Optimal scheduling for flexible job shop operation

This paper presents a new integer linear programming (ILP) model to schedule flexible job shop, discrete parts manufacturing industries that operate on a make-to-order basis. The model considers groups of parallel homogeneous machines, limited intermediate buffers and negligible set-up effects. Orders consist of a number of discrete units to be produced and follow one of a given number of processing routes. The model allows re-circulation to take place, an important issue in practice that has received scant treatment in the scheduling literature. Good solution times were obtained using commercial mixed-integer linear programming (MILP) software to solve realistic examples of flexible job shops to optimality. This supports the claim that recent advances in computational power and MILP solution algorithms are making this approach competitive with others traditionally applied in job shop scheduling.

[1]  Arman R. Yaghubian,et al.  Dry-or-buy decision support for dry kiln scheduling in furniture production , 2001 .

[2]  Iiro Harjunkoski,et al.  Solving a large-scale industrial scheduling problem using MILP combined with a heuristic procedure , 2002, Eur. J. Oper. Res..

[3]  Donald E. Brown,et al.  Intelligent Scheduling Systems , 1995 .

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

[5]  John A. Marin,et al.  A Survey of Intelligent Scheduling Systems , 1995 .

[6]  R. Sargent,et al.  The optimal operation of mixed production facilities—a general formulation and some approaches for the solution , 1996 .

[7]  J. Lenstra,et al.  Job-Shop Scheduling by Implicit Enumeration , 1977 .

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

[9]  G. Rand.  Sequencing and Scheduling: An Introduction to the Mathematics of the Job-Shop , 1982 .

[10]  C. Pantelides,et al.  A simple continuous-time process scheduling formulation and a novel solution algorithm , 1996 .

[11]  Sheik Meeran,et al.  Deterministic job-shop scheduling: Past, present and future , 1999, Eur. J. Oper. Res..

[12]  Chao-Hsien Pan,et al.  A study of integer programming formulations for scheduling problems , 1997, Int. J. Syst. Sci..

[13]  Chinyao Low,et al.  Mathematical modelling and heuristic approaches to operation scheduling problems in an FMS environment , 2001 .

[14]  Reha Uzsoy,et al.  Benchmarks for shop scheduling problems , 1998, Eur. J. Oper. Res..

[15]  Gintaras V. Reklaitis,et al.  Overview of Scheduling and Planning of Batch Process Operations , 1996 .

[16]  Peter B. Luh,et al.  Scheduling of manufacturing systems using the Lagrangian relaxation technique , 1991, IEEE Trans. Autom. Control..

[17]  A. Barbosa‐Póvoa,et al.  An Improved RTN Continuous-Time Formulation for the Short-term Scheduling of Multipurpose Batch Plants , 2001 .

[18]  Pius J. Egbelu,et al.  SCHEDULING IN A PRODUCTION ENVIRONMENT WITH MULTIPLE PROCESS PLANS PER JOB , 1999 .

[19]  Ignacio E. Grossmann,et al.  Decomposition techniques for multistage scheduling problems using mixed-integer and constraint programming methods , 2002 .

[20]  Zhiwei Zhu,et al.  Minimizing the sum of earliness/tardiness in multi-machine scheduling: a mixed integer programming approach , 2000 .

[21]  Tadeusz Sawik,et al.  Mixed integer programming for scheduling flexible flow lines with limited intermediate buffers , 2000 .

[22]  Stephen J. Wilkinson.  Aggregate formulations for large-scale process scheduling problems , 1996 .

[23]  Shi-Chung Chang,et al.  Scheduling flexible flow shops with no setup effects , 1994, IEEE Trans. Robotics Autom..

[24]  Jeremy F. Shapiro,et al.  Mathematical programming models and methods for production planning and scheduling , 1988 .

[25]  Dion H. Cummings Mckoy.  Production scheduling in a process and assembly job shop , 1999 .

[26]  Ching-Jong Liao,et al.  An Improved Formulation for the Job-Shop Scheduling Problem , 1992 .

[27]  C. Pantelides,et al.  Optimal Campaign Planning/Scheduling of Multipurpose Batch/Semicontinuous Plants. 2. A Mathematical Decomposition Approach , 1996 .

[28]  R. Sargent,et al.  A general algorithm for short-term scheduling of batch operations—II. Computational issues , 1993 .