Scheduling with common due date, earliness and tardiness penalties for multimachine problems: A survey

Mathematical and Computer Modelling

Volumn 40, Issue 5-6, 2004, Pages 637-655

  Lauff, V ^a   Werner, F ^a  

^a OTTO VON GUERICKE UNIVERSITY   (Germany)

Author keywords

Common due date; Earliness tardiness penalties; Multimachine scheduling; Nonregular criteria

Indexed keywords

FUNCTIONS; MACHINERY; MATHEMATICAL MODELS; SCHEDULING;

MULTIMACHINE PROBLEMS; OBJECTIVE FUNCTIONS; SINGLE MACHINE PROBLEMS; TARDINESS PENALTIES;

PROBLEM SOLVING;

EID: 12944258951     PISSN: 08957177     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.mcm.2003.05.019     Document Type: Article

References (26)

1. U. Bagchi, R. Sullivan, and Y. Chang Minimizing absolute and squared deviations of completion times with different earliness and tardiness penalties and a common due date Naval Res. Logist. Quart. 34 1987 739 751
2. K.R. Baker, and G.D. Scudder Sequencing with earliness and tardiness penalties Operations Research 38 1989 22 36
3. J.J. Kanet Minimizing the average deviations of job completion times about a common due date Naval Res. Logist. Quart. 28 1981 643 651
4. V. Gordon, J.-M. Proth, and C. Chu A survey of the state-of-the-art of common due date assignment and scheduling research Comp. Oper. Res. 31 2004 317 345
5. R.L. Graham, E.L. Lawler, J.K. Lenstra, and A.H.G. Rinnooy Kan Optimization and approximation in deterministic sequencing and scheduling Annals of Discr. Math. 5 1979 287 326
6. V. Lauff and F. Werner, On the complexity of some properties of multi-stage scheduling problems withearliness and tardiness penalties, Comput. Oper. Res. (to appear).
7. S.T. Webster The complexity of scheduling job families about a common due date Oper. Res. Lett. 20 1997 65 74
8. M.R. Garey, D.S. Johnson, and R. Sethi The complexity of flowshop and jobshop scheduling Math. Oper. Res. 1 1976 117 129
9. N.G. Hall Single and multi-processor models for minimizing completion time variance Naval Res. Logist. Quart. 33 1986 49 54
10. P. Sundararaghavan, and M. Ahmed Minimizing the sum of absolute lateness in single machine and multi-machine scheduling Naval Res. Logist. Quart. 31 1984 325 333
11. H. Emmons Scheduling to a common due-date on parallel uniform processors Naval Res. Logist. 34 1987 803 810
12. A. Federgruen, and G. Mosheiov Heuristics for multimachine scheduling problems with earliness and tardiness costs Manage. Sci. 42 1996 1544 1555
13. A. Federgruen, and G. Mosheiov Heuristics for multimachine scheduling problems with earliness and tardiness costs Erratum 43 1997 735
14. A. Federgruen, and G. Mosheiov Heuristics for multimachine minmax scheduling problems with general earliness and tardiness costs Naval Res. Logist. 44 1997 287 299
15. G. Mosheiov, and M. Shadmon Minmax earliness-tardiness costs with unit processing times European J. Oper. Res. 130 2001 638 652
16. H. Sun, and G. Wang Parallel machine earliness and tardiness scheduling with proportional weights Comput. Oper. Res. 30 2003 801 808
17. J. Bank, and F. Werner Heuristic algorithms for unrelated parallel machine scheduling with a common due date, release dates, and linear earliness and tardiness penalties Mathl. Comput. Modelling 33 4/5 2001 363 383
18. W. Kubiak, S. Lou, and S. Sethi Equivalence of mean flow time problems and mean absolute deviation problems Oper. Res. Lett. 9 6 1990 371 374
19. H. Sarper Minimizing the sum of absolute deviations about a common due date for the two-machine flow shop problem Appl. Math. Modelling 19 1995 153 161
20. M. Nawaz, E.E. Enscore, and I. Ham A heuristic algorithm for the m-machine, n-job flow shop sequencing problem OMEGA 11 1983 91 95
21. Journal of Mathematical Modelling and Algorithms (to appear) J.N.D. Gupta, V. Lauff, and F. Werner A Branch and Bound Algorithm for Two-Machine Flow Shop Problems with Earliness and Tardiness Penalties 1999 FMA, Otto-von-Guericke-Universität Magdeburg Delft
22. J.N.D. Gupta, V. Lauff, and F. Werner On the solution of 2-machine flow shop problems with a common due date K. Inderfurth Operations Research Proceedings 1999 2000 SOR 383 388
23. International Journal of Operations & Quantitative Management (to appear) V. Lauff, and F. Werner Heuristics for Two-Machine Flow Shop Problems with Earliness and Tardiness Penalties 2001 FMA, Otto-von-Guericke- Universität Magdeburg Magdeburg
24. C.S. Sung, and J.I. Min Scheduling in a two-machine flow shop with batch processing machine(s) for earliness/tardiness measure under a common due date European J. Oper. Res. 131 2001 95 106
25. J.A. Ventura, and M.X. Weng An improved dynamic programming algorithm for the single machine mean absolute deviation problem with a restrictive common due date Oper. Res. Lett. 17 1995 149 152
26. K. Gowrishankar, C. Rajendran, and G. Srinivasan Flow shop scheduling algorithms for minimizing the completion time variance and the sum of squares of completion time deviations from a common due date European J. Oper. Res. 132 2001 643 665