Minimizing the sum of earliness/tardiness in multi-machine scheduling: a mixed integer programming approach

[1]  Kenneth R. Baker,et al.  An experimental comparison of solution algorithms for the single‐machine tardiness problem , 1974 .

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

[3]  Jeffrey B. Sidney,et al.  Optimal Single-Machine Scheduling with Earliness and Tardiness Penalties , 1977, Oper. Res..

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

[5]  Marshall L. Fisher,et al.  An Applications Oriented Guide to Lagrangian Relaxation , 1985 .

[6]  Thomas E. Morton,et al.  The single machine early/tardy problem , 1989 .

[7]  Edward Anderson,et al.  Two new rules to minimize tardiness in a job shop , 1990 .

[8]  Mesbah U. Ahmed,et al.  Minimizing the Weighted Sum of Late and Early Completion Penalties in a Single Machine , 1990 .

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

[10]  Esther M. Arkin,et al.  Weighted-Tardiness Scheduling on Parallel Machines with Proportional Weights , 1991, Oper. Res..

[11]  Suresh Chand,et al.  A Single Machine Model for Determination of Optimal Due Dates and Sequence , 1992, Oper. Res..

[12]  Milan Vlach,et al.  Scheduling with earliness and tardiness penalties , 1992 .

[13]  Krishna R. Pattipati,et al.  A practical approach to job-shop scheduling problems , 1993, IEEE Trans. Robotics Autom..

[14]  W. Szwarc,et al.  Weighted Tardiness Single Machine Scheduling with Proportional Weights , 1993 .

[15]  H. Nagasawa,et al.  Single-machine scheduling for minimizing total cost with identical, asymmetrical earliness and tardiness penalties , 1993 .

[16]  John J. Kanet,et al.  Single-machine scheduling with early and tardy completion costs , 1993 .

[17]  W. Szwarc.  Adjacent orderings in single-machine scheduling with earliness and tardiness penalties , 1993 .

[18]  Candace Arai Yano,et al.  Minimizing mean tardiness and earliness in single machine scheduling problems with unequal due-dates , 1994 .

[19]  Thomas Tautenhahn.  Scheduling Unit-Time Open Shops with Deadlines , 1994, Oper. Res..

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

[21]  A. M. A. Hariri,et al.  Single machine scheduling with deadlines to minimize the weighted number of tardy jobs , 1994 .

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

[23]  Wlodzimierz Szwarc,et al.  Optimal timing schedules in earliness-tardiness single machine sequencing , 1995 .

[24]  E. Balas,et al.  The one-machine problem with delayed precedence constraints and its use in job shop scheduling , 1995 .

[25]  Chengbin Chu,et al.  Single Machine Scheduling with Chain Structured Precedence Constraints and Separation Time Windows , 2004 .