Flexible job-shop scheduling with extended route flexibility for semiconductor manufacturing

Scheduling decisions have an important impact on the overall performance of a semiconductor manufacturing facility (fab). To account for machines that consist of several interdependent components, we generalize the flexible job-shop scheduling problem. We introduce the concept of route graphs to describe resource dependencies. Beside specifying feasible routes, route graphs can, for example, prescribe two different operations in the route of a job to use the very same resource. To solve the problem, we introduce an adapted disjunctive graph representation and propose a heuristic method that iteratively inserts jobs to construct an initial solution. This solution is then improved using a simulated annealing meta-heuristic. Several numerical experiments are performed. First, improved results for a real-world instance justify the increased complexity of our model. Second, a comparison to results of dedicated methods for the flexible job-shop scheduling problem shows that our approach obtains good results.

[1]  Frank Werner,et al.  Insertion Techniques for the Heuristic Solution of the Job Shop Problem , 1995, Discret. Appl. Math..

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

[3]  Shengwei Ding,et al.  Multicluster tools scheduling: an integrated event graph and network model approach , 2006, IEEE Transactions on Semiconductor Manufacturing.

[4]  Myoungsoo Ham,et al.  Integer programming-based real-time dispatching (i-RTD) heuristic for wet-etch station at wafer fabrication , 2012 .

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

[6]  Jan Karel Lenstra,et al.  Job Shop Scheduling by Simulated Annealing , 1992, Oper. Res..

[7]  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..

[8]  Johann L. Hurink,et al.  Tabu search for the job-shop scheduling problem with multi-purpose machines , 1994 .

[9]  Jan Karel Lenstra,et al.  Job Shop Scheduling by Local Search , 1996, INFORMS J. Comput..

[10]  Rolf H. Möhring,et al.  Scheduling with AND/OR Precedence Constraints , 2004, SIAM J. Comput..

[11]  Mitsuo Gen,et al.  A hybrid genetic and variable neighborhood descent algorithm for flexible job shop scheduling problems , 2008, Comput. Oper. Res..

[12]  Stéphane Dauzère-Pérès,et al.  A modified shifting bottleneck procedure for job-shop scheduling , 1993 .

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

[14]  F. Al-Shamali,et al.  Author Biographies. , 2015, Journal of social work in disability & rehabilitation.

[15]  Stéphane Dauzère-Pérès,et al.  Multi-resource shop scheduling with resource flexibility , 1998, Eur. J. Oper. Res..

[16]  Bernd Jurisch,et al.  Scheduling jobs in shops with multi-purpose machines , 1992 .

[17]  Lawrence M. Wein,et al.  Scheduling semiconductor wafer fabrication , 1988 .

[18]  Egon Balas,et al.  The Shifting Bottleneck Procedure for Job Shop Scheduling , 1988 .

[19]  Michael Pinedo,et al.  Scheduling: Theory, Algorithms, and Systems , 1994 .

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

[21]  Tae-Eog Lee,et al.  A review of scheduling theory and methods for semiconductor manufacturing cluster tools , 2008, 2008 Winter Simulation Conference.

[22]  Christopher D. Geiger,et al.  A Tabu search approach to scheduling an automated wet etch station , 1997 .

[23]  Rjm Rob Vaessens.  Generalized job shop scheduling : complexity and local search , 1995 .

[24]  Luca Maria Gambardella,et al.  Effective Neighborhood Functions for the Flexible Job Shop Problem , 1998 .

[25]  David Eppstein,et al.  Parallel Recognition of Series-Parallel Graphs , 1992, Inf. Comput..

[26]  Pascal Van Hentenryck,et al.  Large Neighborhood Search and Adaptive Randomized Decompositions for Flexible Jobshop Scheduling , 2011, IJCAI.

[27]  Stéphane Dauzère-Pérès,et al.  Extensions of an integrated approach for multi-resource shop scheduling , 2003, IEEE Trans. Syst. Man Cybern. Part C.

[28]  Peter J. Stuckey,et al.  Scheduling Optional Tasks with Explanation , 2013, CP.

[29]  Yazid Mati,et al.  A general approach for optimizing regular criteria in the job-shop scheduling problem , 2011, Eur. J. Oper. Res..

[30]  E. Nowicki,et al.  A Fast Taboo Search Algorithm for the Job Shop Problem , 1996 .

[31]  Peter Brucker,et al.  Job-shop scheduling with multi-purpose machines , 1991, Computing.

[32]  Tamás Kis,et al.  Job-shop scheduling with processing alternatives , 2003, Eur. J. Oper. Res..

[33]  Stéphane Dauzère-Pérès,et al.  An integrated approach for modeling and solving the general multiprocessor job-shop scheduling problem using tabu search , 1997, Ann. Oper. Res..

[34]  Martin Josef Geiger,et al.  Test Instances for the Flexible Job Shop Scheduling Problem with Work Centers , 2012 .