An efficient algorithm for the single machine total tardiness problem

IIE Transactions (Institute of Industrial Engineers)

Volumn 33, Issue 8, 2001, Pages 661-674

  Tansel, B C ^a   Kara, B Y ^a   Sabuncuoglu, I ^a  

^a BILKENT UNIVERSITY   (Turkey)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; BOUNDARY CONDITIONS; C (PROGRAMMING LANGUAGE); COMPUTATIONAL COMPLEXITY; COMPUTER SIMULATION; DATA STRUCTURES; DYNAMIC PROGRAMMING; JOB ANALYSIS; THEOREM PROVING;

SEARCH TREE; SINGLE MACHINE TOTAL TARDINESS PROBLEM;

SCHEDULING;

EID: 0035427219     PISSN: 0740817X     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1010931215795     Document Type: Article

References (25)

1. A dynamic priority rule for scheduling against due-dates
2. On decomposition of the total tardiness problem
3. Minimizing total tardiness on one machine is NP-hard
4. One machine sequencing to minimize certain functions of job tardiness
5. A dual algorithm for the one machine scheduling problem
6. A heuristic solution procedure to minimize T-bar on a single machine
7. A heuristic algorithm for sequencing on one machine to minimize total tardiness
8. A 'pseudo polynomial' algorithm for sequencing jobs to minimize total tardiness
9. Complexity of machine scheduling problems
10. Scheduling with deadlines and loss functions
11. A heuristic for the single machine tardiness problem
12. The time dependent traveling salesman problem and its application to the tardiness problem in one machine scheduling
13. A decomposition algorithm for the single machine total tardiness problem
14. A branch and bound algorithm for the total weighted tardiness problem
15. Dynamic programming and decomposition approaches for the single machine total tardiness problem
16. Myopic heuristics for the single machine weighted tardiness problem
17. Minimizing total costs in one machine scheduling
18. Dynamic programming solution of sequencing problems with precedence constraints
19. On the n job one machine sequence independent scheduling with tardiness penalties: A branch and bound solution
20. An algorithm for the single machine sequencing problem to minimize total tardiness
21. On the single machine scheduling problem with tardiness penalties
22. A hybrid algorithm for the one machine sequencing problem to minimize total tardiness
23. Decomposition of the single machine total tardiness problem
24. New insights on the single machine total tardiness problem
25. An improved method for scheduling independent tasks