Dynasearch for the earliness-tardiness scheduling problem with release dates and setup constraints

Operations Research Letters

Volumn 34, Issue 5, 2006, Pages 591-598

  Sourd, Francis ^a  

^a UNIVERSITÉ PIERRE ET MARIE CURIE   (France)

Author keywords

Earliness tardiness scheduling; Very large neighborhood search

Indexed keywords

CONSTRAINT THEORY; COSTS; POLYNOMIALS; SCHEDULING;

EARLINESS-TARDINESS SCHEDULING; PSEUDO-POLYNOMIAL TIME; SETUP CONSTRAINTS; VERY LARGE NEIGHBORHOOD SEARCH;

MACHINE SHOP PRACTICE;

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

References (6)

1. Ahuja R.K., Ergun O., Orlin J.B., and Punnen A.P. A survey of very large-scale neighborhood search techniques. Discrete Appl. Math. 123 (2002) 75-103
2. Congram R.K., Potts C.N., and van de Velde S.L. An iterated dynasearch algorithm for the single-machine total weighted tardiness scheduling problem. INFORMS J. Comput. 14 (2002) 52-67
3. Grosso A., Della Croce F., and Tadei R. An enhanced dynasearch neighborhood for the single-machine total weighted tardiness scheduling problem. Oper. Res. Lett. 32 (2004) 68-72
4. W. Nuijten, T. Bousonville, F. Focacci, D. Godard, C. Le Pape, Towards a real-life manufacturing scheduling problem and test bed, Proceedings of PMS'04, 2004, pp. 162-165. 〈http://www2.ilog.com/masclib〉.
5. Sourd F. Earliness-tardiness scheduling with setup considerations. Comput. Oper. Res. 32 (2005) 1849-1865
6. Sourd F. Optimal timing of a sequence of tasks with general completion costs. European J. Oper. Res. 165 (2005) 82-96