Insights into two solution procedures for the single machine tardiness problem

Journal of the Operational Research Society

Volumn 53, Issue 7, 2002, Pages 800-806

  Naidu, J T ^a   Gupta, J N D ^b   Alidaee, B ^c  

^a THOMAS JEFFERSON UNIVERSITY   (United States)

^b UNIVERSITY OF ALABAMA IN HUNTSVILLE   (United States)

^c UNIVERSITY OF MISSISSIPPI   (United States)

Author keywords

Minimizing tardiness; Modified due date rule; Optimal and heuristic decomposition; Single machine scheduling

Indexed keywords

ALGORITHMS; HEURISTIC METHODS; OPTIMIZATION; SCHEDULING; SET THEORY;

HEURISTIC DECOMPOSITION; MODIFIED DUE DATE RULE; OPTIMAL DECOMPOSITION; SINGLE MACHINE SCHEDULING;

OPERATIONS RESEARCH;

EID: 0036639493     PISSN: 01605682     EISSN: None     Source Type: Journal    
DOI: 10.1057/palgrave.jors.2601384     Document Type: Article

References (21)

1. Minimizing total tardiness on one machine is NP-hard
2. The total tardiness problem: Review and extensions
3. One machine sequencing to minimize certain functions of job tardiness
4. New insights on the single machine total tardiness problem
5. A 'pseudo-polynomial' algorithm for sequencing jobs to minimize total tardiness
6. A decomposition algorithm for the single machine total tardiness problem
7. On decomposition of the total tardiness problem
8. A new decomposition approach for the single machine total tardiness scheduling problem
9. Single machine total tardiness problem revisited
10. Decomposition of the single machine total tardiness problem
11. Solution of the single machine total tardiness problem
12. Algorithmic paradoxes of the single machine total tardiness problem
13. A dynamic priority rule for scheduling against due-dates
14. A heuristic algorithm for sequencing on one machine to minimize total tardiness
15. A heuristic for the single machine tardiness problem
16. Single machine tardiness sequencing heuristics
17. Evaluation of greedy, myopic and less-greedy heuristics for the single machine total tardiness problem
18. Priority rules for job shop with weighted tardiness costs
19. A note on the weighted tardiness problem
20. Job shop scheduling with modified due-dates
21. A note on the equivalence of two heuristics to minimize total tardiness