Formulating and solving a multi-mode resource-collaboration and constrained scheduling problem (MRCCSP)

The main motivation of this study is to provide, for the first time, a formulation and solution for a class of production scheduling problems (as in cluster tools) characterized mainly by resource collaboration to perform an operation and while allowing batches and considering alternative production methods. We develop a formulation for the new problem and term it a multiple mode per operation, resource collaboration, and constrained scheduling problem (MRCCSP). Some of the important new characteristics we consider are: multiple products (families); multiple orders (jobs) per family; precedence restrictions among the operations that constitute a job; alternative modes for the performance of an operation (each of which needs a set of collaborating resources) may be defined; complementary and exclusive restrictions between operation-modes; batch production is allowed; and setup times may depend on sequence and batch-size. The objective of the MRCCSP is to minimize makespan. We formulate the MRCCSP as a mixed integer linear programming model, and acknowledging the considerable size of the monolithic formulation required, we prescribe a specific method to achieve size reduction. Finally, a customized branch and bound algorithm for optimally solving this problem is proposed and examined experimentally.

[1]  Stephen C. Graves,et al.  Scheduling of re-entrant flow shops , 1983 .

[2]  Alessandro Agnetis,et al.  Batch Scheduling in a Two-machine Flow Shop with Limited Buffer , 1997, Discret. Appl. Math..

[3]  Michael Pinedo,et al.  Planning and Scheduling in Manufacturing and Services , 2008 .

[4]  Stéphane Dauzère-Pérès,et al.  Scheduling job families on non-identical parallel machines with time constraints , 2011, Proceedings of the 2011 Winter Simulation Conference (WSC).

[5]  Hanif D. Sherali,et al.  Evolution and state-of-the-art in integer programming , 2000 .

[6]  Nick Bostrom,et al.  When machines outsmart humans , 2003 .

[7]  Gad Rabinowitz,et al.  A genetic algorithm-based approach for solving the resource-sharing and scheduling problem , 2009, Comput. Ind. Eng..

[8]  Christian Artigues,et al.  A branch and bound method for the job-shop problem with sequence-dependent setup times , 2008, Ann. Oper. Res..

[9]  Sönke Hartmann,et al.  Project scheduling with multiple modes: A comparison of exact algorithms , 1998 .

[10]  Roman Słowiński,et al.  Advances in project scheduling , 1989 .

[11]  Kripa Shanker,et al.  A branch and bound based heuristic for multi-product resource constrained scheduling problem in FMS environment , 1999, Eur. J. Oper. Res..

[12]  Cem Canel,et al.  An algorithm for scheduling batches of parts in a multi-cell flexible manufacturing system , 2005 .

[13]  Sönke Hartmann,et al.  A survey of variants and extensions of the resource-constrained project scheduling problem , 2010, Eur. J. Oper. Res..

[14]  Subhashish Samaddar,et al.  A scheduling model for multirobot assembly cells , 1991 .

[15]  Tadeusz Sawik.  Loading and scheduling of a flexible assembly system by mixed integer programming , 2004, Eur. J. Oper. Res..

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

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

[18]  Chris N. Potts,et al.  Scheduling a two-stage hybrid flow shop with parallel machines at the first stage , 1997, Ann. Oper. Res..

[19]  Subhashish Samaddar,et al.  Resource sharing and scheduling for cyclic production in a computer-integrated manufacturing cell , 1999 .

[20]  Arno Sprecher,et al.  Minimal delaying alternatives and semi-active timetabling in resource-constrained project scheduling , 1996 .

[21]  Yazid Mati,et al.  A genetic-search-guided greedy algorithm for multi-resource shop scheduling with resource flexibility , 2008 .

[22]  Salah E. Elmaghraby,et al.  Activity networks: Project planning and control by network models , 1977 .

[23]  Lin-Yu Tseng,et al.  Two-Phase Genetic Local Search Algorithm for the Multimode Resource-Constrained Project Scheduling Problem , 2009, IEEE Transactions on Evolutionary Computation.

[24]  Jen-Shiang Chen,et al.  A branch and bound procedure for the reentrant permutation flow-shop scheduling problem , 2006 .

[25]  V. Maniezzo,et al.  An Exact Algorithm for the Resource-Constrained Project Scheduling Problem Based on a New Mathematical Formulation , 1998 .

[26]  Chris N. Potts,et al.  Scheduling with batching: A review , 2000, Eur. J. Oper. Res..

[27]  Arno Sprecher,et al.  On Semi-Active Timetabling in Resource-Constrained Project Scheduling , 1999 .

[28]  S. Iassinovski,et al.  An integrated production planning and scheduling system for hybrid flowshop organizations , 2001 .

[29]  Meral Azizoglu,et al.  Scheduling a batch processing machine with non-identical job sizes , 2000 .

[30]  Christoph A. Schneeweiss,et al.  Hierarchies in Distributed Decision Making , 1999 .

[31]  G. Rabinowitz,et al.  A Customized Branch and Bound Algorithm to Solve the Resource-Sharing and Scheduling Problem (RSSP) , 2006, 2006 IEEE International Conference on Computational Cybernetics.

[32]  Narendra Karmarkar,et al.  A new polynomial-time algorithm for linear programming , 1984, Comb..

[33]  Feng Chu,et al.  A Petri Net Method for Schedulability and Scheduling Problems in Single-Arm Cluster Tools With Wafer Residency Time Constraints , 2008, IEEE Transactions on Semiconductor Manufacturing.

[34]  Peter Brucker,et al.  A branch and bound algorithm for the resource-constrained project scheduling problem , 1998, Eur. J. Oper. Res..

[35]  Rolf H. Möhring,et al.  Resource-constrained project scheduling: Notation, classification, models, and methods , 1999, Eur. J. Oper. Res..

[36]  Rong-Ho Lin,et al.  Meta-heuristic algorithms for wafer sorting scheduling problems , 2011, J. Oper. Res. Soc..

[37]  Subhashish Samaddar,et al.  Production , Manufacturing and Logistics An experimental analysis of solution performance in a resource sharing and scheduling problem , 2005 .

[38]  Shimon Y. Nof,et al.  Coordination of Robots Sharing Assembly Tasks , 1985 .

[39]  Mauricio G. C. Resende,et al.  A random key based genetic algorithm for the resource constrained project scheduling problem , 2009, Comput. Oper. Res..

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

[41]  Chris N. Potts,et al.  Branch and Bound Algorithms for Single Machine Scheduling with Batching to Minimize the Number of Late Jobs , 2005, J. Sched..

[42]  John N. Hooker,et al.  An Integrated Method for Planning and Scheduling to Minimize Tardiness , 2006, Constraints.

[43]  Tae-Eog Lee,et al.  Scheduling single-armed cluster tools with reentrant wafer flows , 2006 .

[44]  Majid Sabzehparvar,et al.  A mathematical model for the multi-mode resource-constrained project scheduling problem with mode dependent time lags , 2008, The Journal of Supercomputing.

[45]  Tadeusz Sawik,et al.  Monolithic vs. hierarchical balancing and scheduling of a flexible assembly line , 2002, Eur. J. Oper. Res..

[46]  U. Dorndorf,et al.  A Time-Oriented Branch-and-Bound Algorithm for Resource-Constrained Project Scheduling with Generalised Precedence Constraints , 2000 .

[47]  Bayerische Julius-Maximilians-Universitat,et al.  Modeling and Optimization of Cluster Tools in Semiconductor Manufacturing , 2004 .

[48]  Grzegorz Waligóra,et al.  Project scheduling with finite or infinite number of activity processing modes - A survey , 2011, Eur. J. Oper. Res..

[49]  J. H. Patterson,et al.  An Algorithm for a general class of precedence and resource constrained scheduling problems , 1989 .

[50]  H. Neil Geismar,et al.  Sequencing and Scheduling in Robotic Cells: Recent Developments , 2005, J. Sched..