Algorithms for single machine total tardiness scheduling with sequence dependent setups

European Journal of Operational Research

Volumn 175, Issue 2, 2006, Pages 722-739

  Gupta, Skylab R ^a   Smith, Jeffrey S ^a  

^a AUBURN UNIVERSITY   (United States)

Author keywords

Heuristics; Scheduling; Sequence dependent setups; Total tardiness

Indexed keywords

ADAPTIVE ALGORITHMS; ALGORITHMS; HEURISTIC METHODS; OPERATIONS RESEARCH; PROBLEM SOLVING; SEQUENTIAL MACHINES;

GREEDY RANDOMIZED ADAPTIVE SEARCH PROCEDURE (GRASP); SEQUENCE DEPENDENT SETUPS; SPACE BASED LOCAL SEARCH HEURISTIC; TOTAL TARDINESS;

SCHEDULING;

EID: 33748423575     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ejor.2005.05.018     Document Type: Article

References (22)

1. Conway R., Maxwell W., and Miller L. Theory of Scheduling (1967), Addison-Wesley, Reading, MA
2. Allahverdi A., Gupta J.N., and Aldowaisan T. A review of scheduling research involving setup considerations. Omega 27 (1999) 219-239
3. Panwalkar S., Dudek R., and Smith M. Sequencing research and the industrial scheduling problem. In: Beckmann M., Goos P., and Zurich H. (Eds). Symposium on the Theory of Scheduling and Its Applications (1973), Springer-Verlag, New York 29-38
4. Kim S., and Bobrowski P. Impact of sequence dependent setup time on job shop scheduling performance. International Journal of Production Research 32 7 (1994) 1503-1520
5. Du J., and Leung J.Y.-T. Minimizing total tardiness on one machine is np-hard. Mathematics of Operations Research 15 (1990) 483-495
6. Koulamas C. The total tardiness problem: Review and extensions. Operations Research 42 (1994) 1025-1041
7. Graham R., Lawler E., Lenstra J., and Kan A.R. Optimization and approximation in deterministic sequencing and scheduling: A survey. Annals of Discrete Mathematics 5 (1979) 287-326
8. Tan K.-C., Narasimhan R., Rubin P.A., and Ragatz G.L. A comparison of four methods for minimizing total tardiness on a single processor with sequence dependent setup times. Omega 28 (2000) 313-325
9. K.R. Baker, Elements of sequencing and scheduling, Tuck School of Business, Dartmouth College, Hanover, 2002.
10. G.L. Ragatz, A branch and bound method for minimum tardiness sequencing on a single processor with sequence dependent setup times, in: Proceedings of the Twenty Fourth Annual Meeting of the Decision Sciences Institute, 1993, pp. 1375-1377.
11. Rubin P.A., and Ragatz G.L. Scheduling in a sequence dependent setup environment with genetic search. Computers and OR 22 1 (1995) 85-99
12. Tan K.-C., and Narasimhan R. Minimizing tardiness on a single processor with sequence dependent setup times: a simulated annealing approach. Omega 25 6 (1997) 619-634
13. Lee Y., Bhaskran K., and Pinedo M. A heuristic to minimize total weighted tardiness with sequence dependent setups. IIE Transactions 29 1 (1997) 45-52
14. França P.M., Mendes A., and Moscato P. Theory and methodology: A memetic algorithm for the total tardiness single machine scheduling problem. European Journal of Operational Research 132 (2001) 224-242
15. Gagné C., Price W., and Gravel M. Comparing an aco algorithm with other heuristics for the single machine scheduling problem with sequence-dependent setup times. Journal of the Operational Research Society 53 (2002) 895-906
16. Desrosiers J., Dumas Y., Solomon M., and Soumis F. Chapter 2: Time constrained routing and scheduling. In: Ball M., Magnanti T., Monma C., and Nemhauser G. (Eds). Handbooks in Operations Research and Management Science. Network Routing vol. 8 (1995), North-Holland, Amsterdam, The Netherlands 35-139
17. Resende M.G., and Ribeiro C.C. Chapter 8: Greedy randomized adaptive search procedures. In: Glover F.W., and Kochenberger G.A. (Eds). Handbook of Metaheuristics. International Series in Operations Research and Management Science vol. 57 (2002), Kluwer Academic Publishers
18. Mladenović N., and Hansen P. Variable neighborhood search. Computers and OR 24 11 (1997) 1097-1100
19. C. Blum, A. Roli, Metaheuristics in combinatorial optimization: Overview and conceptual comparison, Tech. Rep. TR/IRIDIA/2001-13, IRIDIA, Université Libre de Bruxelles, Belgium, October 2001.
20. I. Or, Travelling salesman-type combinatorial problems and their relation to the logistics of blood banking, Ph.D. thesis, Department of Industrial Engineering and Management Sciences, Northwestern University, Evanston, 1976.
21. Storer R.H., Wu S.D., and Vaccari R. New search spaces for sequencing problems with application to job shop scheduling. Management Science 38 10 (1992) 1495-1509
22. Storer R.H., Wu S.D., and Vaccari R. Problem and heuristic space search strategies for job shop scheduling. ORSA Journal on Computing 7 4 (1995) 453-487