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 条
  • [41] Distance matrix based heuristics to minimize makespan of parallel batch processing machines with arbitrary job sizes and release times
    Zhou, Shengchao
    Chen, Huaping
    Li, Xueping
    APPLIED SOFT COMPUTING, 2017, 52 : 630 - 641
  • [42] Scheduling three-operation jobs in a two-machine flow shop to minimize makespan
    Gupta, JND
    Koulamas, CP
    Kyparisis, GJ
    Potts, CN
    Strusevich, VA
    ANNALS OF OPERATIONS RESEARCH, 2004, 129 (1-4) : 171 - 185
  • [43] Scheduling Three-Operation Jobs in a Two-Machine Flow Shop to Minimize Makespan
    Jatinder N.D. Gupta
    Christos P. Koulamas
    George J. Kyparisis
    Chris N. Potts
    Vitaly A. Strusevich
    Annals of Operations Research, 2004, 129 : 171 - 185
  • [44] Optimal robot scheduling to minimize the makespan in a three-machine flow-shop environment with job-independent processing times
    Shabtay, Dvir
    Arviv, Kfir
    APPLIED MATHEMATICAL MODELLING, 2016, 40 (5-6) : 4231 - 4247
  • [45] A simulated annealing for hybrid flow shop scheduling with multiprocessor tasks to minimize makespan
    Wang, Hui-Mei
    Chou, Fuh-Der
    Wu, Ful-Chiang
    INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY, 2011, 53 (5-8) : 761 - 776
  • [46] A simulated annealing for hybrid flow shop scheduling with multiprocessor tasks to minimize makespan
    Hui-Mei Wang
    Fuh-Der Chou
    Ful-Chiang Wu
    The International Journal of Advanced Manufacturing Technology, 2011, 53 : 761 - 776
  • [47] Variable neighbourhood search for minimising tardiness objectives on flow shop with batch processing machines
    Lei, Deming
    Guo, XiuPing
    INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 2011, 49 (02) : 519 - 529
  • [48] Mixed batch scheduling with non-identical job sizes to minimize makespan
    Fan, Guo-Qiang
    Wang, Jun-Qiang
    Liu, Zhixin
    OR SPECTRUM, 2025, 47 (01) : 105 - 127
  • [49] Scheduling identical parallel batch processing machines to minimise makespan using genetic algorithms
    Damodaran, Purushothaman
    Hirani, Neal S.
    Velez-Gallego, Mario C.
    EUROPEAN JOURNAL OF INDUSTRIAL ENGINEERING, 2009, 3 (02) : 187 - 206
  • [50] Schedule Execution for Two-Machine Job-Shop to Minimize Makespan with Uncertain Processing Times
    Sotskov, Yuri N.
    Matsveichuk, Natalja M.
    Hatsura, Vadzim D.
    MATHEMATICS, 2020, 8 (08)