Neighborhood search procedures for single machine tardiness scheduling with sequence-dependent setups

Theoretical Computer Science

Volumn 434, Issue , 2012, Pages 45-52

  Liao, Ching Jong ^a   Tsou, Hsin Hui ^a   Huang, Kuo Ling ^a  

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

Author keywords

Neighborhood; Sequence dependent setups; Single machine; Weighted tardiness

Indexed keywords

NEIGHBORHOOD; NEIGHBORHOOD SEARCH; SEQUENCE DEPENDENT SETUPS; SINGLE MACHINE; TIME COMPLEXITY; WEIGHTED TARDINESS;

COMPUTER SCIENCE;

EID: 84859898656     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2012.01.043     Document Type: Article

References (15)

1. A. Allahverdi, J.N.D. Gupta, and T. Aldowaisan A review of scheduling research involving setup considerations OMEGA 27 1999 219 239
2. V.A. Cicirello, Weighted tardiness scheduling with sequence-dependent setups: a benchmark library, Technical Report (2003), Intelligent Coordination and Logistics Laboratory, Robotics Institute, Carnegie Mellon University.
3. Ö Ergun, New neighborhood search algorithms based on exponentially large neighborhoods, Operations Research Center Thesis, MIT, 2001.
4. Ö. Ergun, and J.B. Orlin Fast neighborhood search for the single machine total weighted tardiness problem Operations Research Letters 34 2006 41 45
5. P.M. Frana, A. Mendes, and P. Moscato A memetic algorithm for the total tardiness single machine scheduling problem European Journal of Operational Research 132 2001 224 242
6. C. Gagné, W.L. Price, and M. Gravel 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
7. C. Gagné, M. Gravel, W.L. Price, A new hybrid Tabu-VNS metaheuristic for solving multiple objective scheduling problems, in: Proceedings of the Fifth Metaheuristics International Conference, Kyoto, Japan, 2003.
8. H. Kellerer, and V.A. Strusevich A fully polynomial approximation scheme for the single machine weighted total tardiness problem with a common due date Theoretical Computer Science 369 2006 230 238
9. S.G. Kolliopoulos, and G. Steiner Approximation algorithms for minimizing the total weighted tardiness on a single machine Theoretical Computer Science 355 2006 261 273
10. E.L. Lawler A 'pseudopolynomial' algorithm for sequencing jobs to minimize total tardiness Annals of Discrete Mathematics 1 1997 331 342
11. Y.H. Lee, K. Bhaskaram, and M. Pinedo A heuristic to minimize the total weighted tardiness with sequence-dependent setups IIE Transactions 29 1997 45 52
12. C.J. Liao, and H.C. Juan An ant colony optimization for single machine tardiness scheduling with sequence-dependent setups Computers & Operations Research 34 2007 1899 1909
13. M. Pinedo Scheduling: Theory, Algorithm, and Systems second ed. 2002 Prentice-Hall
14. P.A. Rubin, and G.L. Ragatz Scheduling in a sequence dependent setup environment with genetic search Computers & Operations Research 22 1995 85 99
15. K.C. Tan, and R. Narasimhan Minimizing tardiness on a single processor with sequence-dependent setup times: a simulated annealing approach OMEGA 25 1997 619 634