IP-Based Real-Time Dispatching for Two-Machine Batching Problem With Time Window Constraints

A binary integer programming based real-time dispatching heuristic (i-RTD) approach to minimize the makespan of the two-machine batching flow-shop problem with time window constraints is presented for the first time. By scheduling only necessary batches at each iteration, i -RTD works with considerably fewer binary variables so that it runs in real-time. The experimental study demonstrates the proposed i-RTD can generate the efficient solution in real-time, which implies we can implement the proposed approach into real industry where a quick and efficient schedule is required.

[1]  Yang Song,et al.  Bottleneck Station Scheduling in Semiconductor Assembly and Test Manufacturing Using Ant Colony Optimization , 2007, IEEE Transactions on Automation Science and Engineering.

[2]  John W. Fowler,et al.  Scheduling of unrelated parallel machines: an application to PWB manufacturing , 2002 .

[3]  I. K. Altinel,et al.  General continuous time models for production planning and scheduling of batch processing plants: mixed integer linear program formulations and computational issues , 2001 .

[4]  Ching-Jong Liao,et al.  Improved MILP models for two-machine flowshop with batch processing machines , 2008, Math. Comput. Model..

[5]  C. S. Sung,et al.  Minimizing makespan on a single burn-in oven in semiconductor manufacturing , 2000, Eur. J. Oper. Res..

[6]  Douglas C. Montgomery,et al.  Optimal batching in a wafer fabrication facility using a multiproduct G/G/c model with batch processing , 2002 .

[7]  Pengyu Yan,et al.  A branch and bound algorithm for optimal cyclic scheduling in a robotic cell with processing time windows , 2010 .

[8]  Purushothaman Damodaran,et al.  Mixed integer formulation to minimize makespan in a flow shop with batch processing machines , 2004, Math. Comput. Model..

[9]  Purushothaman Damodaran,et al.  Scheduling a capacitated batch-processing machine to minimize makespan , 2007 .

[10]  V. Erramilli,et al.  Multiple Orders Per Job Compatible Batch Scheduling , 2006, IEEE Transactions on Electronics Packaging Manufacturing.

[11]  John W. Fowler,et al.  Genetic algorithm based scheduling of parallel batch machines with incompatible job families to minimize total weighted tardiness , 2004 .

[12]  Ravi Sethi,et al.  The Complexity of Flowshop and Jobshop Scheduling , 1976, Math. Oper. Res..

[13]  John W. Fowler,et al.  Minimizing total weighted tardiness on a single batch process machine with incompatible job families , 2005, Comput. Oper. Res..

[14]  Reha Uzsoy,et al.  Minimizing makespan on a single batch processing machine with dynamic job arrivals , 1999 .

[15]  John W. Fowler,et al.  Scheduling of Wet Etch and Furnace Operations with Next Arrival Control Heuristic , 2008 .

[16]  Lei Lei,et al.  Optimal Cyclic Scheduling Of A Robotic Processing Line With Two-Product And Time-Window Constraints , 2001 .

[17]  Ali Husseinzadeh Kashan,et al.  An improved mixed integer linear formulation and lower bounds for minimizing makespan on a flow shop with batch processing machines , 2008 .

[18]  M. Mathirajan,et al.  A literature review, classification and simple meta-analysis on scheduling of batch processors in semiconductor , 2006 .

[19]  M. K. Omar,et al.  Hierarchical production planning and scheduling in a multi-product, batch process environment , 2007 .

[20]  John W. Fowler,et al.  A new scheduling approach using combined dispatching criteria in wafer fabs , 2003 .

[21]  Sharif H. Melouk,et al.  Minimizing makespan on parallel batch processing machines , 2004 .

[22]  H.-S. Yan,et al.  A Case Study on Integrated Production Planning and Scheduling in a Three-Stage Manufacturing System , 2007, IEEE Transactions on Automation Science and Engineering.

[23]  R. Bixby,et al.  Short-Interval Detailed Production Scheduling in 300mm Semiconductor Manufacturing using Mixed Integer and Constraint Programming , 2006, The 17th Annual SEMI/IEEE ASMC 2006 Conference.

[24]  Myoungsoo Ham,et al.  Dynamic photo stepper dispatching/scheduling in wafer fabrication , 2005, ISSM 2005, IEEE International Symposium on Semiconductor Manufacturing, 2005..

[25]  Yeong-Dae Kim,et al.  Heuristics for a two-stage hybrid flowshop scheduling problem with ready times and a product-mix ratio constraint , 2009, J. Heuristics.

[26]  Shi-Chung Chang,et al.  Daily scheduling for R&D semiconductor fabrication , 1993, [1993] Proceedings IEEE International Conference on Robotics and Automation.

[27]  Lixin Tang,et al.  Minimizing makespan in a two-machine flowshop scheduling with batching and release time , 2009, Math. Comput. Model..

[28]  Young Hoon Lee,et al.  Real-time scheduling of multi-stage flexible job shop floor , 2011 .

[29]  Wen Lea Pearn,et al.  Minimising makespan on parallel batch processing machines with non-identical ready time and arbitrary job sizes , 2009 .

[30]  N. Govind,et al.  Integrated Targeting, Near Real-Time Scheduling, and Dispatching with Automated Execution in Semiconductor Manufacturing , 2007, 2007 IEEE/SEMI Advanced Semiconductor Manufacturing Conference.

[31]  Yan Chen,et al.  Scheduling jobs on parallel machines with setup times and ready times , 2008, Comput. Ind. Eng..

[32]  Pyung-Hoi Koo,et al.  Scheduling a single batch processing machine with arbitrary job sizes and incompatible job families , 2005 .

[33]  Ronald D. Armstrong,et al.  A bounding scheme for deriving the minimal cycle time of a single-transporter N-stage process with time-window constraints , 1994 .