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 条
  • [1] Makespan minimization in a no-wait flow shop problem with two batching machines
    Oulamara, Ammar
    [J]. COMPUTERS & OPERATIONS RESEARCH, 2007, 34 (04) : 1033 - 1050
  • [2] AN ORTHOGONAL GENETIC ALGORITHM WITH TOTAL FLOWTIME MINIMIZATION FOR THE NO-WAIT FLOW SHOP PROBLEM
    Liao, Xiao-Ping
    [J]. PROCEEDINGS OF 2009 INTERNATIONAL CONFERENCE ON MACHINE LEARNING AND CYBERNETICS, VOLS 1-6, 2009, : 1706 - 1711
  • [3] Scheduling a no-wait flow shop containing unbounded batching machines
    Oulamara, A
    Kovalyov, MY
    Finke, G
    [J]. IIE TRANSACTIONS, 2005, 37 (08) : 685 - 696
  • [4] Fast tabu search algorithm for no-wait flow shop problem with makespan criterion
    Grabowski, J
    Pempera, J
    [J]. 8TH WORLD MULTI-CONFERENCE ON SYSTEMICS, CYBERNETICS AND INFORMATICS, VOL V, PROCEEDINGS: COMPUTER SCIENCE AND ENGINEERING, 2004, : 333 - 338
  • [5] Minimizing makespan in a two-machine no-wait flow shop with batch processing machines
    Muthuswamy, Shanthi
    Velez-Gallego, Mario C.
    Maya, Jairo
    Rojas-Santiago, Miguel
    [J]. INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY, 2012, 63 (1-4): : 281 - 290
  • [6] Minimizing makespan in a two-machine no-wait flow shop with batch processing machines
    Shanthi Muthuswamy
    Mario C. Vélez-Gallego
    Jairo Maya
    Miguel Rojas-Santiago
    [J]. The International Journal of Advanced Manufacturing Technology, 2012, 63 : 281 - 290
  • [7] An improved iterated greedy algorithm for the no-wait flow shop scheduling problem with makespan criterion
    Quan-Ke Pan
    Ling Wang
    Bao-Hua Zhao
    [J]. The International Journal of Advanced Manufacturing Technology, 2008, 38 : 778 - 786
  • [8] An improved iterated greedy algorithm for the no-wait flow shop scheduling problem with makespan criterion
    Pan, Quan-Ke
    Wang, Ling
    Zhao, Bao-Hua
    [J]. INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY, 2008, 38 (7-8): : 778 - 786
  • [9] A genetic algorithm and particle swarm optimization for no-wait flow shop problem with separable setup times and makespan criterion
    Hamed Samarghandi
    Tarek Y. ElMekkawy
    [J]. The International Journal of Advanced Manufacturing Technology, 2012, 61 : 1101 - 1114
  • [10] A genetic algorithm for two-stage no-wait hybrid flow shop scheduling problem
    Wang, Shijin
    Liu, Ming
    [J]. COMPUTERS & OPERATIONS RESEARCH, 2013, 40 (04) : 1064 - 1075
12345