A greedy heuristic for the mean tardiness sequencing problem

Computers and Operations Research

Volumn 21, Issue 3, 1994, Pages 329-336

  Fadlalla, Adam ^a   Evans, James R ^b   Lew, Martin S ^b  

^a Saudi Arabian Central Bank ^*  (Saudi Arabia)

^b UNIVERSITY OF CINCINNATI   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

JOB ANALYSIS; MATHEMATICAL PROGRAMMING; OPERATIONS RESEARCH; OPTIMIZATION; SCHEDULING;

BRANCH AND BOUND ALGORITHMS; GREEDY HEURISTIC; MEAN TARDINESS SEQUENCING PROBLEM; WILKENSEN-IRWIN PROCEDURE;

HEURISTIC METHODS;

EID: 0028399847     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/0305-0548(94)90094-9     Document Type: Article

References (17)

1. An experimental comparison of solution algorithms for the single machine tardiness problem
2. Heuristic sequencing of single and multiple components
3. Minimizing total tardiness on one process is NP-hard
4. A dual algorithm for the one machine scheduling problem
5. A “pseudopolynomial” algorithm for sequencing jobs to minimize total tardiness
6. Sequencing with delay costs
7. Accurate myopic heuristics for tardiness scheduling
8. A decomposition algorithm for the single machine total tardiness problem
9. Single machine tardiness sequencing heuristics
10. Minimizing total costs in one machine scheduling
11. Dynamic programming solution of sequencing problems with precedence constraints
12. A state of the art survey of static scheduling research involving due dates
13. A hybrid algorithm for the one machine sequencing problem to minimize total tardiness
14. An improved algorithm for scheduling independent tasks