Mathematical models for preemptive shop scheduling problems

More than half a century has passed since Bowman and Dantzig (1959) 13,14] introduced their models for preemptive shop scheduling problems. A more efficient model seems to be needed to address all the aspects involved in the problem. We introduce a new Integer Linear Programming (ILP) formulation as a new method for solving the preemptive Job Shop Scheduling Problem (pJSSP). The dimension of the new model, unlike those of the existing ones, depends solely on the number of jobs and machines irrespective of processing times. The proposed model is used as an optimal, two-phase approach. In phase one, the model is solved to obtain the start and completion times of each operation on each machine. In phase two, a simple algorithm in O(mnlogn) steps is used to turn these times into a complete and optimal schedule. Different preemptive flow shop problems are studied as special cases of the pJSSP while some related properties are also discussed. Finally, the higher efficiency of the proposed model is verified both theoretically and computationally through its comparison with conventional methods commonly in use.

[1]  Fan T. Tseng,et al.  Two MILP models for the N × M SDST flowshop sequencing problem , 2001 .

[2]  Peter Brucker,et al.  Preemptive job-shop scheduling problems with a fixed number of jobs , 1999, Math. Methods Oper. Res..

[3]  Fariborz Jolai,et al.  Mathematical modeling and heuristic approaches to flexible job shop scheduling problems , 2007, J. Intell. Manuf..

[4]  Maged Dessouky,et al.  Dynamic models of production with multiple operations and general processing times , 1997 .

[5]  Rong-Hwa Huang,et al.  Ant colony system for job shop scheduling with time windows , 2008 .

[6]  E. Stafford,et al.  On the Srikar-Ghosh MILP model for the iVx M SDST flowshop problem , 1990 .

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

[8]  Wai Keung Wong,et al.  Mathematical model and genetic optimization for the job shop scheduling problem in a mixed- and multi-product assembly environment: A case study based on the apparel industry , 2006, Comput. Ind. Eng..

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

[10]  T. S. Jayram,et al.  Tighter Bounds on Preemptive Job Shop Scheduling with Two Machines , 2001, Computing.

[11]  Peter Brucker,et al.  Job-shop Scheduling Problem , 2009, Encyclopedia of Optimization.

[12]  George B. Dantzig,et al.  A Machine-Job Scheduling Model , 1960 .

[13]  Jen-Shiang Chen,et al.  Mixed binary integer programming formulations for the reentrant job shop scheduling problem , 2005, Comput. Oper. Res..

[14]  M.C. Gomes *,et al.  Optimal scheduling for flexible job shop operation , 2005 .

[15]  Ping Wu,et al.  A multi-agent ant colony optimization algorithm for earliness/tardiness scheduling with different due window on non-uniform parallel machines , 2006 .

[16]  Fan T. Tseng,et al.  Two models for a family of flowshop sequencing problems , 2002, Eur. J. Oper. Res..

[17]  Philippe Baptiste,et al.  A branch and bound to minimize the number of late jobs on a single machine with release time constraints , 2003, Eur. J. Oper. Res..

[18]  Harvey M. Wagner,et al.  An integer linear‐programming model for machine scheduling , 1959 .

[19]  Edward F. Stafford,et al.  On the Development of a Mixed-Integer Linear Programming Model for the Flowshop Sequencing Problem , 1988 .

[20]  E. H. Bowman.  THE SCHEDULE-SEQUENCING PROBLEM* , 1959 .

[21]  A. J. Clewett,et al.  Introduction to sequencing and scheduling , 1974 .

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

[23]  Natalia V. Shakhlevich,et al.  NP-hardness of Shop-scheduling Problems with Three Jobs , 1995, Discret. Appl. Math..

[24]  John M. Wilson,et al.  Alternative Formulations of a Flow-shop Scheduling Problem , 1989 .

[25]  Alan S. Manne,et al.  On the Job-Shop Scheduling Problem , 1960 .