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 条
  • [1] An improved mixed integer linear formulation and lower bounds for minimizing makespan on a flow shop with batch processing machines
    Ali Husseinzadeh Kashan
    Behrooz Karimi
    The International Journal of Advanced Manufacturing Technology, 2009, 40 : 582 - 594
  • [2] An improved mixed integer linear formulation and lower bounds for minimizing makespan on a flow shop with batch processing machines
    Kashan, Ali Husseinzadeh
    Karimi, Behrooz
    INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY, 2009, 40 (5-6): : 582 - 594
  • [3] Heuristics to minimize makespan of parallel batch processing machines
    Purushothaman Damodaran
    Ping-Yu Chang
    The International Journal of Advanced Manufacturing Technology, 2008, 37 : 1005 - 1013
  • [4] Heuristics to minimize makespan of parallel batch processing machines
    Damodaran, Purushothaman
    Chang, Ping-Yu
    INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY, 2008, 37 (9-10): : 1005 - 1013
  • [5] Heuristics to minimize makespan of parallel batch processing machines
    Damodaran, Purushothaman
    Chang, Ping-Yu
    International Journal of Advanced Manufacturing Technology, 2008, 37 (9-10): : 1005 - 1013
  • [6] Minimizing Makespan in a Flow Shop with Two Batch Machines
    Huang, Jin-dian
    Liu, Jian-jun
    Chen, Qing-xin
    Mao, Ning
    PROCEEDINGS OF THE 22ND INTERNATIONAL CONFERENCE ON INDUSTRIAL ENGINEERING AND ENGINEERING MANAGEMENT: CORE THEORY AND APPLICATIONS OF INDUSTRIAL ENGINEERING (VOL 1), 2016, : 283 - 292
  • [7] An Efficient Algorithmto Minimize Makespan on Parallel Batch Processing Machines
    Chakravorty, Arindam
    Saha, Shirshasis
    Laha, Dipak
    Das, Abhirup
    2020 4TH INTERNATIONAL CONFERENCE ON COMPUTATIONAL INTELLIGENCE AND NETWORKS (CINE 2020), 2020,
  • [8] Genetic algorithms for minimizing makespan in a flow shop with two capacitated batch processing machines
    Manjeshwar, Praveen Kumar
    Damodaran, Purushothaman
    Srihari, Krishnaswami
    INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY, 2011, 55 (9-12): : 1171 - 1182
  • [9] Genetic algorithms for minimizing makespan in a flow shop with two capacitated batch processing machines
    Praveen Kumar Manjeshwar
    Purushothaman Damodaran
    Krishnaswami Srihari
    The International Journal of Advanced Manufacturing Technology, 2011, 55 : 1171 - 1182
  • [10] Exact algorithms to minimize makespan on single and parallel batch processing machines
    Muter, Ibrahim
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2020, 285 (02) : 470 - 483