Heuristics for two-machine flow shop problems with earliness and tardiness penalties

International Journal of Operations and Quantitative Management

Volumn 10, Issue 2, 2004, Pages 125-144

  Lauff, Volker ^a   Werner, Frank ^a  

^a OTTO VON GUERICKE UNIVERSITY   (Germany)

Author keywords

Flow shop; Heuristics; Nonregular performance measures; Scheduling

Indexed keywords

EID: 84871491615     PISSN: 10821910     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (13)

1. Baker, K.R. and G. D. Scudder, "Sequencing with earliness and tardiness penalties," Operations Research, 38, 1989, 22 - 36.
2. Hall, N. and M. Posner, "Earliness-tardiness scheduling problems, i: Weighted deviation of completion times about a common due date," Operations Research, 5, 1991, 836 - 846.
3. Hall, N., W. Kubiak and S. Sethi, "Earliness-tardiness scheduling problems, ii: Deviation of completion times about a restrictive common due date," Operations Research, 5, 1991, 847 - 856.
4. Bagchi, U., 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 Research Logistics Quarterly, 34, 1987, 739 - 751.
5. Szwarc, W., "Single machine scheduling to minimize absolute deviation of completion times from a common due date," Naval Research Logistics Quarterly, 36, 1989, 663 - 673.
6. Graham, R.L., E. L. Lawler, J. K. Lenstra and A. H. G. Rinnooy Kan, "Optimization and approximation in deterministic sequencing and scheduling," Annals of Discrete Mathematics, 5, 1979, 287 - 326.
7. Sarper, H., "Minimizing the sum of absolute deviations about a common due date for the two-machine flow shop problem," Applied Mathematical Modelling, 19, 1995, 153-161.
8. Gupta, J.N.D., V. Lauff and F. Werner, "A branch and bound algorithm for two-machine flow shop problems with earliness and tardiness penalties," Otto-von-Guericke-Universität, FMA, Preprint 33/99, 1999 (to appear in Journal of Mathematical Modelling and Algorithms).
9. Kanet, J., "Minimizing the average deviation of job completion times about a common due date," Naval Research Logistics Quarterly, 28, 1981, 643 - 651.
10. Nawaz, M., E. E. Enscore and I. Ham, "A heuristic algorithm for the m-machine, n-job flow shop sequencing problem," OMEGA, 11, 1983, 91 - 95.
11. Kahlbacher, H.G.: "Scheduling with monotonous earliness and tardiness penalties," European Journal of Operational Research, 64, 1993, 258 - 277.
12. Eglese, R.W., "Simulated annealing: A tool for operational research," European Journal of Operational Research, 46, 1990, 271 - 281.
13. Lundy, M. and A. Mees, "Convergence of an annealing algorithm," Mathematical Programming, 34, 1986, 111 - 124.