A genetic algorithm for Makespan minimization in a no-wait flow shop problem with two batching machines

被引：3
|
作者：
Jolai, F. [1 ]
Kor, H. [1 ]
Hatefi, S. M. [1 ]
Iranmanesh, H. [1 ]
机构：
[1] Univ Tehran, Dept Ind Engn, Coll Engn, Tehran, Iran
来源：
2009 INTERNATIONAL CONFERENCE ON COMPUTER ENGINEERING AND TECHNOLOGY, VOL II, PROCEEDINGS | 2009年
关键词：
No-wait flowshop problem; Makespan; Batch processing machines; Complexity; genetic algortihm; 2-MACHINE FLOWSHOP;
D O I：
10.1109/ICCET.2009.215
中图分类号：
TP31 [计算机软件];
学科分类号：
081202 ; 0835 ;
摘要：
In this paper we consider a scheduling problem where a set of jobs are simultaneously available for processing in a no-wait two-machine flowshop. All jobs are processed on both machines in batches. Batching machines can process several tasks per batch so that all tasks of the same batch start and complete together. The batch processing time for the first machine is equal to the maximal processing time of the tasks in this batch, and for the second machine is equal to the sum of the processing times of the tasks in this batch. The objective is to minimize the makespan, i.e. the maximum completion time of the jobs with using genetic algorithm and finding the best scheduling jobs.
引用
收藏
页码：238 / 242
页数：5
相关论文
共 50 条
  • [31] Makespan Minimization in Two-Machine Flow-Shop Scheduling under No-wait and Deterministic Unavailable Interval Constraints
    Chen, Kejia
    Li, Debiao
    Wang, Xiao
    [J]. JOURNAL OF SYSTEMS SCIENCE AND SYSTEMS ENGINEERING, 2020, 29 (04) : 400 - 411
  • [32] Minimizing Makespan in Flow Shop under No-wait Restriction on Jobs
    Nailwal, Kewal Krishan
    Gupta, Deepak
    Sharma, Sameer
    [J]. 2016 INTERNATIONAL CONFERENCE ON ELECTRICAL, ELECTRONICS, AND OPTIMIZATION TECHNIQUES (ICEEOT), 2016, : 1555 - 1559
  • [33] A constructive heuristic for minimizing makespan in no-wait flow shop scheduling
    Laha, Dipak
    Chakraborty, Uday K.
    [J]. INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY, 2009, 41 (1-2): : 97 - 109
  • [34] A constructive heuristic for minimizing makespan in no-wait flow shop scheduling
    Dipak Laha
    Uday K. Chakraborty
    [J]. The International Journal of Advanced Manufacturing Technology, 2009, 41 : 97 - 109
  • [35] Effective heuristics for the no-wait flow shop scheduling problem with total flow time minimization
    Kaizhou Gao
    Quanke Pan
    P. N. Suganthan
    Junqing Li
    [J]. The International Journal of Advanced Manufacturing Technology, 2013, 66 : 1563 - 1572
  • [36] Effective heuristics for the no-wait flow shop scheduling problem with total flow time minimization
    Gao, Kaizhou
    Pan, Quanke
    Suganthan, P. N.
    Li, Junqing
    [J]. INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY, 2013, 66 (9-12): : 1563 - 1572
  • [37] Integrating preventive maintenance activities to the no-wait flow shop scheduling problem with dependent-sequence setup times and makespan minimization
    Miyata, Hugo Hissashi
    Nagano, Marcelo Seido
    Gupta, Jatinder N. D.
    [J]. COMPUTERS & INDUSTRIAL ENGINEERING, 2019, 135 : 79 - 104
  • [38] Minimizing makespan for a no-wait flowshop using genetic algorithm
    Chaudhry, Imran Ali
    Khan, Abdul Munem
    [J]. SADHANA-ACADEMY PROCEEDINGS IN ENGINEERING SCIENCES, 2012, 37 (06): : 695 - 707
  • [39] Minimizing makespan for a no-wait flowshop using genetic algorithm
    IMRAN ALI CHAUDHRY
    ABDUL MUNEM KHAN
    [J]. Sadhana, 2012, 37 : 695 - 707
  • [40] A discrete whale optimization algorithm for the no-wait flow shop scheduling problem
    Zhang, Sujun
    Gu, Xingsheng
    [J]. MEASUREMENT & CONTROL, 2023, 56 (9-10): : 1764 - 1779
12345