Minimizing the sum of earliness/tardiness in identical parallel machines schedule with incompatible job families: An improved MIP approach

This research considers the problem of scheduling jobs on a set of identical parallel machines, with distinct due dates, process time and early due date restrictions. Further more, the jobs originate from incompatible product families, making it a sequence-dependent setup every time a job is switched from one family to another. Based on the policy that discourages both jobs being early as well as late, we focus on minimizing the sum of earliness/tardiness in the presence of setups. We developed a mixed integer programming formulation model to deal with such scheduling problems. The model can provide optimal solutions for up to 18 jobs that originate from up to four incompatible families.

[1]  Chung-Lun Li,et al.  The parallel machine min-max weighted absolute lateness scheduling problem , 1994 .

[2]  Jatinder N. D. Gupta,et al.  A review of scheduling research involving setup considerations , 1999 .

[3]  Meral Azizoglu,et al.  Scheduling job families about an unrestricted common due date on a single machine , 1997 .

[4]  T.C.E. Cheng,et al.  Parallel-Machine Scheduling Problems with Earliness and Tardiness Penalties , 1994 .

[5]  Hamilton Emmons,et al.  Scheduling to a common due date on parallel uniform processors , 1987 .

[6]  Zhi-Long Chen.  Scheduling with batch setup times and earliness-tardiness penalties , 1997 .

[7]  Wlodzimierz Szwarc.  The weighted common due date single machine scheduling problem revisited , 1996, Comput. Oper. Res..

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

[9]  Jean-Charles Billaut,et al.  Multicriteria scheduling , 2005, Eur. J. Oper. Res..

[10]  Costas P. Pappis,et al.  Scheduling under a common due-data on parallel unrelated machines , 1998, Eur. J. Oper. Res..

[11]  Marc E. Posner,et al.  Earliness-Tardiness Scheduling Problems, I: Weighted Deviation of Completion Times About a Common Due Date , 1991, Oper. Res..

[12]  Nagraj Balakrishnan,et al.  Early/tardy scheduling with sequence dependent setups on uniform parallel machines , 1999, Comput. Oper. Res..

[13]  Funda Sivrikaya-Serifoglu,et al.  Parallel machine scheduling with earliness and tardiness penalties , 1999, Comput. Oper. Res..

[14]  Chung Yee Lee,et al.  Due window scheduling for parallel machines , 1994 .

[15]  W. Szwarc.  Single-machine scheduling to minimize absolute deviation of completion times from a common due date , 1989 .

[16]  Anup K. Sen,et al.  Single machine weighted earliness-tardiness penalty problem with a common due date , 2001, Comput. Oper. Res..

[17]  J. J. Kanet.  Minimizing the average deviation of job completion times about a common due date , 1981 .

[18]  I. M. Ovacikt,et al.  Rolling horizon algorithms for a single-machine dynamic scheduling problem with sequence-dependent setup times , 1994 .

[19]  Warren B. Powell,et al.  Solving Parallel Machine Scheduling Problems by Column Generation , 1999, INFORMS J. Comput..

[20]  Gary D. Scudder,et al.  Sequencing with Earliness and Tardiness Penalties: A Review , 1990, Oper. Res..

[21]  S. T. Webster,et al.  The complexity of scheduling job families about a common due date , 1997, Oper. Res. Lett..

[22]  Suresh P. Sethi,et al.  Earliness-Tardiness Scheduling Problems, II: Deviation of Completion Times About a Restrictive Common Due Date , 1991, Oper. Res..

[23]  Yih-Long Chang,et al.  MINIMIZING MEAN ABSOLUTE DEVIATION OF COMPLETION TIMES ABOUT A COMMON DUE DATE. , 1986 .

[24]  B. Alidaee,et al.  A note on minimizing the weighted sum of tardy and early completion penalties in a single machine: A case of small common due date , 1997 .

[25]  Nicholas G. Hall.  Single- and multiple-processor models for minimizing completion time variance , 1986 .

[26]  P. De,et al.  Due‐date assignment and early/tardy scheduling on identical parallel machines , 1994 .

[27]  Gur Mosheiov,et al.  Heuristics for multimachine scheduling problems with earliness and tardiness costs , 1996 .

[28]  A. Federgruen,et al.  Heuristics for multimachine minmax scheduling problems with general earliness and tardiness costs , 1997 .