A hybrid algorithm for the single-machine total tardiness problem

Computers and Operations Research

Volumn 36, Issue 2, 2009, Pages 308-315

  Cheng, T C E ^a   Lazarev, A A ^b   Gafarov, E R ^b  

^a HONG KONG POLYTECHNIC UNIVERSITY   (Hong Kong)

^b RUSSIAN ACADEMY OF SCIENCES   (Russian Federation)

Author keywords

Meta heuristics; Scheduling

Indexed keywords

ALGORITHMS; CIRCUIT THEORY; HEURISTIC METHODS; HEURISTIC PROGRAMMING; NUCLEAR PROPULSION; OPTIMIZATION; STANDARDS;

ANT-COLONY OPTIMIZATION; COMPUTATIONAL EXPERIMENTS; COMPUTATIONAL RESULTS; ELIMINATION RULES; HYBRID ALGORITHM; META-HEURISTICS; NEAR-OPTIMAL SOLUTIONS; NP-HARD; RUNNING TIME; SCHEDULING; SINGLE MACHINES; SINGLE-MACHINE SCHEDULING; TOTAL JOB TARDINESS; TOTAL TARDINESS;

HEURISTIC ALGORITHMS;

EID: 52049085837     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cor.2007.10.002     Document Type: Article

References (12)

1. Du J., and Leung J.Y.-T. Minimizing total tardiness on one processor is NP-hard. Mathematics of Operations Research 15 (1990) 483-495
2. Lawler E.L. A pseudopolynomial algorithm for sequencing jobs to minimize total tardiness. Annals of Discrete Mathematics 1 (1977) 331-342
3. Szwarc W., Della Croce F., and Grosso A. Solution of the single machine total tardiness problem. Journal of Scheduling 2 (1999) 55-71
4. Szwarc W., Grosso A., and Della Croce F. Algorithmic paradoxes of the single machine total tardiness problem. Journal of Scheduling 4 (2001) 93-104
5. Potts C.N., and van Wassenhove L.N. A decomposition algorithm for the single machine total tardiness problem. Operations Research Letters 1 (1982) 177-182
6. Della Croce F., Grosso A., and Paschos V. Lower bounds on the approximation ratios of leading heuristics for the single-machine total tardiness problem. Journal of Scheduling 7 (2004) 85-91
7. Bauer A, Bullnheimer B, Hartl RF, Strauss C. Minimizing total tardiness on a single machine using Ant Colony Optimization. In: Proceedings of the 1999 congress on evolutionary computation (CEC99), Washington, DC, USA, 6-9 July, 1999. p. 1445-50.
8. Lazarev A.A. Solution of the NP-hard total tardiness minimization problem in scheduling theory. Computational Mathematics and Mathematical Physics 47 (2007) 1039-1049
9. Chang S., Lu Q., Tang G., and Yu W. On decomposition of total tardiness problem. Operation Research Letters 17 (1995) 221-229
10. Lazarev AA, Gafarov ER. Scheduling theory: the total tardiness problem. Russia: Computing Centre of the Russian Academy of Sciences; 2006 [in Russian].
11. Lazarev AA, Kvaratskhelia A, Tchernykh A. Solution algorithms for the total tardiness scheduling problem on a single machine. In: Workshop proceedings of the ENC'04 international conference 2004. p. 474-80.
12. Gafarov E.R., and Lazarev A.A. A special case of the single-machine total tardiness problem is NP-hard. Journal of Computer and Systems Sciences International 45 (2006) 450-458