Meta-heuristic approaches for minimizing total earliness and tardiness penalties of single-machine scheduling with a common due date

Journal of Heuristics

Volumn 13, Issue 2, 2007, Pages 151-165

  Lin, Shih Wei ^a   Chou, Shuo Yan ^b   Chen, Shih Chieh ^b  

^a HUAFAN UNIVERSITY   (Taiwan)

^b NATIONAL TAIWAN UNIVERSITY OF SCIENCE AND TECHNOLOGY   (Taiwan)

Author keywords

Common due date; Earliness and tardiness penalties; Greedy local search; Meta heuristics; Scheduling

Indexed keywords

GENETIC ALGORITHMS; MACHINE DESIGN; METADATA; PROBLEM SOLVING; SIMULATED ANNEALING;

DATE SCHEDULING; META HEURISTICS; SINGLE MACHINE SCHEDULING;

HEURISTIC METHODS;

EID: 33847655581     PISSN: 13811231     EISSN: 15729397     Source Type: Journal    
DOI: 10.1007/s10732-006-9002-2     Document Type: Article

References (24)

1. Baker, K.R. and G.D. Scudder. (1990). "Sequencing with Earliness and Tardiness Penalties: A Review." Operations Research 38(1), 22-36.
2. Biskup, D. and M. Feldmann. (2001). "Benchmarks for Scheduling on a Single Machine Against Restrictive and Unrestrictive Common Due Dates."Computers and Operations Research 28(8), 787-801.
3. Gen, M. and R. Cheng. (1997). Genetic Algorithms and Engineering Design. John Wiley & Sons, New York.
4. Goldberg, D.E. (1989). Genetic Algorithms in Search, Optimization, and Machine Learning. Addison-Wesley Publishing Company, Inc., MA.
5. Gordon, V., J.-M. Proth and C. Chu. (2002). "A Survey of the State-of-Art of Common Due Date Assignment and Scheduling Research." European Journal of Operational Research 139(1), 1-25.
6. Gupta, J.N.D., V. Lauff, and F. Werner. (2004). "Two-Machine Flow Shop Problems with Nonregular Criteria." Journal of Mathematical Modelling and Algorithms 3, 123-151.
7. Feldmann, M. and D. Biskup. (2003). "Single-Machine Scheduling for Minimizing Earliness and Tardiness Penalties by Meta-Heuristic Approaches." Computers and Industrial Engineering 44(2), 307-323.
8. James, R.J.W. (1997). "Using Tabu Search to Solve the Common Due Date Early/Tardy Machine Scheduling Problem." Computers and Operations Research 24(3), 199-208.
9. Hall, N.G., W. Kubiak and S.P. Sethi. (1991). "Earliness-Tardiness Scheduling Problem, II: Deviation of Completion Times About a Restrictive Common Due Date." Operations Research 39(5), 847-856.
10. Hino, C.M., D.P. Ronconi, and A.B. Mendes. (2005). "Minimizing Earliness and Tardiness Penalties in a Single-Machine Problem with a Common Due Date." European Journal of Operational Research 160(1), 190-201.
11. Holland, J. (1975). Adaptation in Natural and Artificial Systems. University of Michigan Press, Ann Arbor, Ann Arbor.
12. Hoogeveen, J.A. and S.L. van de Velde (1991). "Scheduling Around a Small Common Due Date." European Journal and Operational Research 55(2), 237-242.
13. Kahlbacher, H.G. (1993). "Scheduling with Monotonous Earliness and Tardiness Penalties." European Journal of Operational Research 64(2), 258-277.
14. Kirkpatrick, S., C.D. Gelatt, Jr., and M.P. Vecchi. (1983). "Optimization by Simulated Annealing." Science 220, 671-680.
15. Lee, C.Y. and S.J. Kim. (1995). "Parallel Genetic Algorithms for the Earliness-Tardiness Job Scheduling Problem with General Penalty Weights." Computers and Industrial Engineering 28(2), 231-243.
16. Liaw, C.-F. (1999). "A Branch-and-Bound Algorithm for the Single Machine Earliness and Tardiness Scheduling Problem." Computers and Operations Research 26, 679-693.
17. Lin, S.-W. and S.-Y. Chou. (2005). "A Sequential Pair Exchange Approach for Solving Single-Machine Scheduling Problems with General Earliness-Tardiness Penalties." In Proceedings of MISTA 2005: The 2nd Multidisciplinary Conference on Scheduling: Theory and Applications, NY, USA, pp. 299-314.
18. Metropolis, N., A.W. Rosenbluth, M.N. Rosenbluth, A.H. Teller, and E. Teller. (1953). "Equations of State Calculations by Fast Computing Machines." Journal of Chemical Physics 21, 1087-1092.
19. Michalewicz, Z. (1992). Genetic Algorithms + Data Structures = Evolution Programs. Springer-Verlag, Berlin.
20. Mittenthal, J., M. Raghavachari, and A.I. Rana. (1993). "A Hybrid Simulated Annealing Approach for Single Machine Scheduling Problems with Non-Regular Penalty Functions." Computers and Operations Research 20, 103-111.
21. Mondal, S.A. and A.K. Sen. (2001). "Single Machine Weighted Burliness-Tardiness Penalty Problem with a Common Due Date." Computers and Operations Research 28, 649-669.
22. Raghavachari, M. (1988). "Scheduling Problems with Non-Regular Penalty Functions: A Review." Operations Research 25, 144-164.
23. Smith, W. E. (1956). "Various Optimizers for Single-Stage Production." Naval Research Logistics Quarterly 3, 59-66.
24. Szwarc, W. (1989). "Single-Machine Scheduling to Minimize Absolute Deviation of Completion Times from a Common Due Date." Naval Research Logistics 36, 663-673.