Earliness/tardiness scheduling with a common due date and family setups

Computers and Industrial Engineering

Volumn 47, Issue 2-3, 2004, Pages 275-288

  Suriyaarachchi, Rasika H ^a   Wirth, Andrew ^b  

^a UNIVERSITY OF WESTERN SYDNEY   (Australia)

^b UNIVERSITY OF MELBOURNE   (Australia)

Author keywords

Common due date; Earliness tardiness scheduling; Family setups

Indexed keywords

ALGORITHMS; COSTS; HEURISTIC METHODS; OPERATIONS RESEARCH; PROBLEM SOLVING;

COMMON DUE DATE; EARLINESS TARDINESS SCHEDULING; FAMILY SETUPS;

SCHEDULING;

EID: 6344228467     PISSN: 03608352     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cie.2004.07.006     Document Type: Article

References (25)

1. Ahn, B. H., & Hyun, J. H. (1990). Single facility multi-class job scheduling. Computers and Operations Research, 77(3), 265-272.
2. Azizoglu, M., & Webster, S. (1997). Scheduling job families about an unrestricted common due date on a single machine. International Journal of Production Research, 35(5), 1321-1330.
3. Bagchi, U., Chang, Y. L., & Sullivan, R. S. (1987). Minimizing absolute and squared deviations of completion times with different earliness and tardiness penalties and a common due date. Naval Research Logistics, 34, 739-751.
4. Bagchi, U., Sullivan, R. S., & Chang, Y. L. (1986). Minimizing mean absolute deviation of job completion times about a common due date. Naval Research Logistics Quarterly, 33, 227-240.
5. Baker, K. R., & Scudder, G. D. (1990). Sequencing with earliness and tardiness penalties: a review. Operations Research, 38(1), 22-36.
6. Chen, Z.-L. (1997). Scheduling with batch setup times and earliness-tardiness penalties. European Journal of Operational Research, 96, 518-537.
7. Dunstall, S. (2000). A study of models and algorithms for machine scheduling problems with setup times. PhD Thesis. The University of Melbourne, Australia.
8. Dunstall, S., & Wirth, A. (1997). Scheduling with class setups and release dates. Paper presented at the international conference of Asia pacific operations research societies (APORS), Melbourne, Australia.
9. Dunstall, S., Wirth, A., & Baker, K. (2000). Lower bounds and heuristics for flowtime minimization on a single machine with set-up times. Journal of Scheduling, 3, 51-69.
10. Goldberg, D. (1989). Genetic algorithms in search, optimization and machine learning. Reading, MA: Addison Wesley.
11. Gupta, J. N. D. (1988). Single facility scheduling with multiple job classes. European Journal of Operational Research, 8, 42-45.
12. Hall, N. G., & Posner, M. E. (1991). Earliness-tardiness scheduling problems, 1: weighted deviation of completion times about a common due date. Operations Research, 39(5), 836-846.
13. Jordan, C. (1996). Batching and scheduling: models and methods for several problem cases. Berlin: Springer.
14. Kanet, J. J. (1981). Minimizing the average deviation of job completion times about a common due date. Naval Research Logistics Quarterly, 28, 643-651.
15. Lawler, E. L., Lenstra, J. K., Rinnoy Kan, A. H. G., & Shmoys, D. B. (1993). Sequencing and scheduling algorithms and complexity. In: S. C. Graves, A. H. G. Rinnoy Kan, & P. H. Zipkin (Ed.), Handbooks in operations research and management science. Logistics of production and inventory (Vol. 4) (pp. 445-522). Amsterdam: North-Holland. Chapter 9.
16. Mason, A. J., & Anderson, E. J. (1991). Minimising now time on a single machine with job classes and setup times. Naval Research Logistics, 38, 333-350.
17. Michalewicz, Z. (1994). Genetic algorithms+data structures=evolution programs. Berlin: Springer.
18. Monma, C. L., & Potts, C. N. (1989). On the complexity of scheduling with batch setup times. Operations Research, 37(5), 798-804.
19. Panwalkar, S. S., Smith, M. L., & Seidmann, A. (1982). Common due date assignment to minimize total penalty for one machine scheduling problem. Operations Research, 30(2), 391-399.
20. Ragavachari, M. (1986). A V-shape property of optimal schedule of jobs about a common due date. European Journal of Operations Research, 23, 401-402.
21. Sidney, J. B. (1977). Optimal single machine scheduling with earliness and tardiness penalties. Operations Research, 25(1), 62-69.
22. Webster, S. (1997). The complexity of scheduling job families about a common due date. Operations Research Letters, 20, 65-74.
23. Webster, S., & Baker, K. R. (1995). Scheduling groups of jobs on a single machine. Operations Research, 43(4), 692-703.
24. Webster, S., Jog, P. D., & Gupta, A. (1998). A genetic algorithm for scheduling job families on a single machine with arbitrary earliness/tardiness penalties and an unrestricted common due date. International Journal of Production Research, 36(9), 2543-2551.
25. Williams, D. N., & Wirth, A. (1996). A new heuristic for a single machine scheduling problem with setup times. Journal of the Operational Research Society, 47, 175-180.