Mixed integer formulation to minimize makespan in a flow shop with batch processing machines

被引:51
|
作者
Damodaran, P [1 ]
Srihari, K [1 ]
机构
[1] SUNY Binghamton, Dept Syst Sci & Ind Engn, Binghamton, NY 13902 USA
关键词
batch processing; scheduling; flow shop; mathematical formulation;
D O I
10.1016/j.mcm.2005.01.005
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
Batch processing machines are commonly used in wafer fabrication, kilns, and chambers used for environmental stress screening (ESS). This paper proposes two models to schedule batches of jobs on two machines in a flow shop. A set of jobs with known processing times and sizes has to be grouped, to form batches, in order to be processed on the batch processing machines. The jobs are nonidentical in size. The processing time of a batch is the longest processing time of all the jobs in that batch. Mixed integer formulations are proposed for the flow shop problem when the buffer capacity is unlimited or zero. Numerical examples are presented to demonstrate the application of our model. (c) 2005 Elsevier Ltd. All rights reserved.
引用
收藏
页码:1465 / 1472
页数:8
相关论文
共 50 条
  • [11] 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
    The International Journal of Advanced Manufacturing Technology, 2012, 63 : 281 - 290
  • [12] Minimizing makespan in a flow shop with two batch-processing machines using simulated annealing
    Manjeshwar, Praveen Kumar
    Damodaran, Purushothaman
    Srihari, Krishnaswami
    ROBOTICS AND COMPUTER-INTEGRATED MANUFACTURING, 2009, 25 (03) : 667 - 679
  • [13] 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
    INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY, 2012, 63 (1-4): : 281 - 290
  • [14] Minimising makespan in a no-wait flow shop with two batch processing machines: A grasp algorithm
    Maya, Jairo
    Muthuswamy, Shanthi
    Vélez-Gallego, Mario C.
    Rojas-Santiago, Miguel
    International Journal of Industrial and Systems Engineering, 2014, 17 (02) : 152 - 169
  • [15] Flow shop scheduling with deteriorating jobs under dominating machines to minimize makespan
    Ji-Bo Wang
    The International Journal of Advanced Manufacturing Technology, 2010, 48 : 719 - 723
  • [16] Scheduling jobs with release dates on parallel batch processing machines to minimize the makespan
    Liu, L. L.
    Ng, C. T.
    Cheng, T. C. E.
    OPTIMIZATION LETTERS, 2014, 8 (01) : 307 - 318
  • [17] Flow shop scheduling with deteriorating jobs under dominating machines to minimize makespan
    Wang, Ji-Bo
    INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY, 2010, 48 (5-8): : 719 - 723
  • [18] Scheduling jobs with release dates on parallel batch processing machines to minimize the makespan
    L. L. Liu
    C. T. Ng
    T. C. E. Cheng
    Optimization Letters, 2014, 8 : 307 - 318
  • [19] Lagrangian approach to minimize makespan of non-identical parallel batch processing machines
    Suhaimi, Nurul
    Nguyen, Christine
    Damodaran, Purushothaman
    COMPUTERS & INDUSTRIAL ENGINEERING, 2016, 101 : 295 - 302
  • [20] Single Item Batch-scheduling Model for a Flow Shop with m Batch-processing Machines to Minimize Total Actual Flow Time
    Halim, Abdul Hakim
    Hidayat, Nita Puspita Anugrawati
    Aribowo, Wisnu
    INTERNATIONAL JOURNAL OF TECHNOLOGY, 2022, 13 (04) : 816 - 826