Fast neighborhood search for the single machine total weighted tardiness problem

Operations Research Letters

Volumn 34, Issue 1, 2006, Pages 41-45

  Ergun, Özlem ^a   Orlin, James B ^b  

^a Georgia Institute of Technology   (United States)

^b MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

Algorithms; Neighborhood search; Single machine scheduling

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; SCHEDULING;

NEIGHBOURHOOD SEARCH; SINGLE MACHINE SCHEDULING;

PROBLEM SOLVING;

EID: 28044439574     PISSN: 01676377     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.orl.2005.01.010     Document Type: Article

References (7)

1. R.K. Congram, C.N. Potts, and S.L. van de Velde An iterated dynasearch algorithm for the single machine total weighted tardiness scheduling problem INFORMS J. Comput. 14 2002 52 67
2. Ö. Ergun, New neighborhood search algorithms based on exponentially large neighborhoods, Operations Research Center Thesis, MIT, Cambridge, MA, 2001.
3. A. Grosso, F. Della Croce, and R. Tadei An enhanced dynasearch neighborhood for the single-machine total weighted tardiness scheduling problem Oper. Res. Lett. 32 2004 68 72
4. E.L. Lawler A 'pseudopolynomial' algorithm for sequencing jobs to minimize total tardiness P.L. Hammer E.L. Johnson B.H. Korte G.L. Nemhauser Studies in Integer Programming, Annals of Discrete Mathematics vol. 1 1977 North-Holland Amsterdam 331 342
5. J.K. Lenstra, A.H.G. Rinnooy Kan, and P. Brucker Complexity of machine scheduling problems P.L. Hammer E.L. Johnson B.H. Korte G.L. Nemhauser Studies in Integer Programming, Annals of Discrete Mathematics vol. 1 1977 North-Holland Amsterdam 343 362
6. C.N. Potts, S.L. van de Velde, Dynasearch - iterative local improvement by dynamic programming, Part I: the traveling salesman problem, Technical Report, University of Twente, The Netherlands, 1995.
7. C.N. Potts, and L.N. van Wassenhove A branch and bound algorithm for the total weighted tardiness problem Oper. Res. 33 1985 363 377