Single-machine scheduling for minimizing earliness and tardiness penalties by meta-heuristic approaches

Computers and Industrial Engineering

Volumn 44, Issue 2, 2003, Pages 307-323

  Feldmann, Martin ^a   Biskup, Dirk ^a  

^a BIELEFELD UNIVERSITY   (Germany)

Author keywords

Common due date; Meta heuristic; Scheduling

Indexed keywords

BENCHMARKING; HEURISTIC METHODS; OPTIMIZATION; SIMULATED ANNEALING;

META-HEURISTICS;

SCHEDULING;

EID: 0037290972     PISSN: 03608352     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0360-8352(02)00181-X     Document Type: Article

References (35)

1. Aarts E.H.L., van Laarhoven P.J.M. Statistical cooling: A general approach to combinatorial optimization problems. Philips Journal of Research. 40:1985;193-226.
2. Ablay P. Ten theses regarding the design of controlled evolution strategies. Becker J.D., Eisele I., Mündemann F.W. Parallelism, Learning, Evolution. 1989;457-480 Springer, Berlin.
3. Althöfer I., Koschnick K.-U. On the convergence of threshold accepting. Applied Mathematics and Optimization. 24:1991;183-195.
4. Bäck T. Evolutionary algorithms in theory and practice. 1996;Oxford University Press, New York.
5. Baker K.R., Scudder G.D. On the assignment of optimal due dates. Journal of the Operational Research Society. 40:1989;93-95.
6. Baker K.R., Scudder G.D. Sequencing with earliness and tardiness penalties: A review. Operations Research. 38:1990;22-36.
7. Biethan J., Nissen V. Evolutionary algorithms in management applications. 1995;Springer, Berlin.
8. Biskup D., Cheng T.C.E. Multiple-machine scheduling with earliness, tardiness and completion time penalties. Computers and Operations Research. 26:1999;45-57.
9. Biskup D., Feldmann M. Benchmarks for scheduling on a single-machine against restrictive and unrestrictive common due dates. Computers and Operations Research. 28:2001;787-801.
10. Cerny V. Thermodynamical approach to the traveling salesman problem: An efficient simulation algorithm. Journal of Optimization Theory and Applications. 45:1985;41-51.
11. Cheng T.C.E., Kahlbacher H.G. A proof for the longest-job-first policy in one-machine scheduling. Naval Research Logistics. 38:1991;715-720.
12. Dueck G., Scheuer T. Threshold accepting: A general purpose optimization algorithm appearing superior to simulated annealing. Journal of Computational Physics. 90:1990;161-175.
13. Feldmann M. Naturanaloge Verfahren. 1999;Gabler, Wiesbaden: Gabler, in German.
14. Feldmann, M. (2000). Threshold accepting with a back step - excellent results with a hybrid variant of threshold accepting. Discussion paper No. 453, Faculty of Economics, University of Bielefeld, Germany.
15. Glass C.A., Potts C.N. A comparison of local search methods for flow shop scheduling. Annals of Operations Research. 63:1996;489-509.
16. Hall N., Kubiak G.W., Sethi S.P. Earliness-tardiness scheduling problems, II: Deviation of completion times about a restrictive common due date. Operations Research. 39:1991;847-856.
17. Hall N.G., Posner M.E. Earliness-tardiness scheduling problems, I: Weighted deviation of completion times about a common due date. Operations Research. 39:1991;836-846.
18. Hoogeveen J.A., van de Velde S.L. Scheduling around a small common due date. European Journal of Operational Research. 55:1991;237-242.
19. James R.J.W. Using tabu search to solve the common due date early/tardy machine scheduling problem. Computers and Operations Research. 24:1997;199-208.
20. Johnson D.S., Aragon C.R., McGeoch L.A., Schevon C. Optimization by simulated annealing: An experimental evaluation; part I, graph partitioning. Operations Research. 37:1989;865-892.
21. Johnson D.S., Aragon C.R., McGeoch L.A., Schevon C. Optimization by simulated annealing: An experimental evaluation; part II, graph coloring and number partitioning. Operations Research. 39:1991;378-406.
22. Kanet J.J. Minimizing the average deviation of job completion times about a common due date. Naval Research Logistics Quarterly. 28:1981;643-651.
23. Kirkpatrick S., Gelatt C.D., Vecchi M.P. Optimization by simulated annealing. Science. 220:1983;671-680.
24. Lee C.-Y., Kim S.J. Parallel genetic algorithms for the earliness-tardiness job scheduling problem with general penalty weights. Computers and Industrial Engineering. 28:1995;231-243.
25. Lee C.-Y., Danusaputro S.L., Lin C.-S. Minimizing weighted number of tardy jobs and weighted earliness-tardiness penalties about a common due date. Computers and Operations Research. 18:1991;379-389.
26. Lin C.K.Y., Haley K.B., Sparks C. A comparative study of both standard and adaptive versions of threshold accepting and simulated annealing algorithms in three scheduling problems. European Journal of Operational Research. 83:1995;330-346.
27. Osman I.H., Christofides N. Capacitated clustering problems by hybrid simulated annealing and tabu search. International Transactions in Operational Research. 1:1994;317-336.
28. Osman I.H., Laporte G. Metaheuristics: A bibliography. Annals of Operations Research. 63:1996;513-625.
29. Panwalkar S.S., Smith M.L., Seidmann A. Common due date assignment to minimize total penalty for the one machine scheduling problem. Operations Research. 30:1982;391-399.
30. Pirlot M. General local search methods. European Journal of Operational Research. 92:1996;493-511.
31. Rechenberg I. Evolutionsstrategie. 1973;Frommann Verlag, Stuttgart. in German.
32. Schwefel H.-P. Evolution and optimum seeking. 1995;Wiley, New York.
33. Szwarc W. Single-machine scheduling to minimize absolute deviation of completion times from a common due date. Naval Research Logistics. 36:1989;663-673.
34. van Laarhoven P.J.M., Aarts E.H.L. Simulated annealing: Theory and applications. 1987;Reidel, Dordrecht.
35. Yeung W.K., Oguz K.C., Cheng T.C.E. Single-machine scheduling with a common due window. Computers and Operations Research. 28:2001;157-175.