A hybrid scheduling approach for a two-stage flexible flow shop with batch processing machines

In this paper, we discuss a flexible flow shop scheduling problem with batch processing machines at each stage and with jobs that have unequal ready times. Scheduling problems of this type can be found in semiconductor wafer fabrication facilities (wafer fabs). We are interested in minimizing the total weighted tardiness of the jobs. We present a mixed integer programming formulation. The batch scheduling problem is NP-hard. Therefore, an iterative stage-based decomposition approach is proposed that is hybridized with neighborhood search techniques. The decomposition scheme provides internal due dates and ready times for the jobs on the first and second stage, respectively. Each of the resulting parallel machine batch scheduling problems is solved by variable neighborhood search in each iteration. Based on the schedules of the subproblems, the internal due dates and ready times are updated. We present the results of designed computational experiments that also consider the number of machines assigned to each stage as a design factor. It turns out that the proposed hybrid approach outperforms an iterative decomposition scheme where a fairly simple heuristic based on time window decomposition and the apparent tardiness cost dispatching rule is used to solve the subproblems. Recommendations for the design of the two stages with respect to the number of parallel machines on each stage are given.

[1]  I. Hamilton Emmons,et al.  Flow Shop Scheduling: Theoretical Results, Algorithms, and Applications , 2012 .

[2]  Young Hwan Kim,et al.  A problem reduction and decomposition approach for scheduling for a flowshop of batch processing machines , 2000, Eur. J. Oper. Res..

[3]  Saral Mukherjee,et al.  Applying machine based decomposition in 2-machine flow shops , 2006, Eur. J. Oper. Res..

[4]  Reha Uzsoy,et al.  A REVIEW OF PRODUCTION PLANNING AND SCHEDULING MODELS IN THE SEMICONDUCTOR INDUSTRY PART I: SYSTEM CHARACTERISTICS, PERFORMANCE EVALUATION AND PRODUCTION PLANNING , 1992 .

[5]  Andreas Klemmt,et al.  Scheduling jobs with time constraints between consecutive process steps in semiconductor manufacturing , 2012, Proceedings Title: Proceedings of the 2012 Winter Simulation Conference (WSC).

[6]  Chuen-Lung Chen,et al.  Bottleneck-based heuristics to minimize total tardiness for the flexible flow line with unrelated parallel machines , 2009, Comput. Ind. Eng..

[7]  Taho Yang,et al.  Scheduling two-stage hybrid flow shops with parallel batch, release time, and machine eligibility constraints , 2012, J. Intell. Manuf..

[8]  Christos Koulamas.  A guaranteed accuracy shifting bottleneck algorithm for the two-machine flowshop total tardiness problem , 1998, Comput. Oper. Res..

[9]  Deming Lei,et al.  Variable neighbourhood search for minimising tardiness objectives on flow shop with batch processing machines , 2011 .

[10]  Lars Mönch,et al.  An iterative approach for the serial batching problem with parallel machines and job families , 2013, Ann. Oper. Res..

[11]  Mohammad Reza Amin-Naseri,et al.  Hybrid flow shop scheduling with parallel batching , 2009 .

[12]  Ari P. J. Vepsalainen.  Priority rules for job shops with weighted tardiness costs , 1987 .

[13]  Lars Mönch,et al.  A simultaneous and iterative approach for parallel machine scheduling with sequence-dependent family setups , 2014, J. Sched..

[14]  Stéphane Dauzère-Pérès,et al.  A batching and scheduling algorithm for the diffusion area in semiconductor manufacturing , 2012 .

[15]  Jonathan F. Bard,et al.  The use of upstream and downstream information in scheduling semiconductor batch operations , 1995 .

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

[17]  Michael Pinedo,et al.  Heuristics for minimizing total weighted tardiness in flexible flow shops , 2000 .

[18]  Hadi Mokhtari,et al.  A robust modelling and optimisation framework for a batch processing flow shop production system in the presence of uncertainties , 2016, Int. J. Comput. Integr. Manuf..

[19]  John W. Fowler,et al.  Production Planning and Control for Semiconductor Wafer Fabrication Facilities - Modeling, Analysis, and Systems , 2013, Operations research / computer science interfaces series.

[20]  John W. Fowler,et al.  A survey of problems, solution techniques, and future challenges in scheduling semiconductor manufacturing operations , 2011, J. Sched..

[21]  Lars Mönch,et al.  Scheduling jobs with ready times and precedence constraints on parallel batch machines using metaheuristics , 2014, Comput. Ind. Eng..

[22]  Young Hwan Kim,et al.  Minimizing due date related performance measures on two batch processing machines , 2003, Eur. J. Oper. Res..

[23]  George L. Vairaktarakis,et al.  Flow Shop Scheduling , 2013 .

[24]  Chuen-Lung Chen,et al.  Bottleneck-based heuristics to minimize tardy jobs in a flexible flow line with unrelated parallel machines , 2008 .

[25]  Rubén Ruiz,et al.  The hybrid flow shop scheduling problem , 2010, Eur. J. Oper. Res..

[26]  John W. Fowler,et al.  Heuristic scheduling of jobs on parallel batch machines with incompatible job families and unequal ready times , 2005, Comput. Oper. Res..

[27]  E.L. Lawler,et al.  Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey , 1977 .

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

[29]  Geun-Cheol Lee,et al.  Bottleneck-focused scheduling for a hybrid flowshop , 2004 .

[30]  Lars Mönch,et al.  Machine learning techniques for scheduling jobs with incompatible families and unequal ready times on parallel batch machines , 2006, Eng. Appl. Artif. Intell..

[31]  Reha Uzsoy,et al.  A Computational Study of Shifting Bottleneck Procedures for Shop Scheduling Problems , 1997, J. Heuristics.

[32]  Young Hwan Kim,et al.  Minimizing makespan in a two-machine flowshop with dynamic arrivals allowed , 2002, Comput. Oper. Res..

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

[34]  Appa Iyer Sivakumar,et al.  Optimisation of flow-shop scheduling with batch processor and limited buffer , 2012 .

[35]  Xianwen Meng,et al.  A heuristic-search genetic algorithm for multi-stage hybrid flow shop scheduling with single processing machines and batch processing machines , 2015, J. Intell. Manuf..

[36]  John W. Fowler,et al.  Decomposition heuristic for a two-machine flow shop with batch processing , 2014, Proceedings of the Winter Simulation Conference 2014.

[37]  Reha Uzsoy,et al.  Decomposition methods for reentrant flow shops with sequence‐dependent setup times , 2000 .

[38]  Purushothaman Damodaran,et al.  Minimizing makespan in a flow shop with two batch-processing machines using simulated annealing , 2009 .

[39]  Reha Uzsoy,et al.  Minimizing total tardiness on a batch processing machine with incompatible job families , 1998 .

[40]  Sheik Meeran,et al.  A multi-level hybrid framework applied to the general flow-shop scheduling problem , 2002, Comput. Oper. Res..

[41]  Ammar Oulamara,et al.  Scheduling hybrid flowshop with parallel batching machines and compatibilities , 2009, Comput. Oper. Res..

[42]  L. Su.  A hybrid two-stage flowshop with limited waiting time constraints , 2003 .

[43]  Ching-Jen Huang,et al.  Tabu search for non-permutation flowshop scheduling problem with minimizing total tardiness , 2010, Appl. Math. Comput..

[44]  Pierre Hansen,et al.  Variable neighborhood search: Principles and applications , 1998, Eur. J. Oper. Res..