A total tardiness problem with preprocessing included

Naval Research Logistics

Volumn 43, Issue 5, 1996, Pages 721-735

  Koulamas, Christos ^a  

^a FLORIDA INTERNATIONAL UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL METHODS; HEURISTIC METHODS; JOB ANALYSIS; PERFORMANCE; POLYNOMIALS; SCHEDULING;

BRANCH AND BOUND ALGORITHM; CUSTOMER ORDERS; JOB COMPLETION TIME; POLYNOMIAL TIME; PREPROCESSING; TOTAL TARDINESS PROBLEM; TWO MACHINE FLOW SHOP;

OPTIMIZATION;

EID: 0030212292     PISSN: 0894069X     EISSN: None     Source Type: Journal    
DOI: 10.1002/(SICI)1520-6750(199608)43:5<721::AID-NAV8>3.0.CO;2-7     Document Type: Article

References (12)

1. Baker, K. R., Introduction to Sequencing and Scheduling, Wiley, New York, 1974.
2. Chu, C., "A Branch-and-Bound Algorithm to Minimize Total Tardiness with Different Release Dates," Naval Research Logistics, 39, 265-283 (1992).
3. Du, J., and Leung, J.Y.T., "Minimizing Total Tardiness on One Machine is NP-Hard," Mathematics of Operations Research, 15, 483-495 (1990).
4. Garey, M.R., Johnson, D.S., and Sethi, R., "The Complexity of Flowshop and Jobshop Scheduling," Mathematics of Operations Research, 1, 117-129 (1976).
5. Johnson, S.S., "Optimal Two and Three Stage Production Schedules with Set-Up Times Included," Naval Research Logistics Quarterly, 1, 61-68 (1954).
6. Kim, Y.D., "A New Branch and Bound Algorithm for Minimizing Mean Tardiness in Two-Machine Flowshops," Computers and Operations Research, 20, 391-401 (1993).
7. Kim, Y.D., "Heuristics for Flowshop Scheduling Problems Minimizing Mean Tardiness," Journal of the Operational Research Society, 44, 19-28 (1993).
8. Koulamas, C., "The Total Tardiness Problem: Review and Extensions," Operations Research, 42, 1025-1041.
9. Lawler, E.L., "A 'Pseudopolynomial' Algorithm for Sequencing Jobs to Minimize Total Tardiness," Annals of Discrete Mathematics, 1, 331-342 (1977).
10. Nawaz, M., Enscore, E.E., Jr., and Ham, I., "A Heuristic Algorithm for the m-Machine, n-Job Flowshop Scheduling Problem," Omega, 11, 91-95 (1983).
11. Panwalkar, S.S., Dudek, R.A., and Smith, M.L., "Sequencing Research and the Industrial Scheduling Problem," in S.E. Elmaghraby (Ed.), Symposium on the Theory of Scheduling and its Applications, Springer-Verlag, Berlin, 1973.
12. Sen, T., Dileepan, P., and Gupta, J.N.D., "The Two-Machine Flowshop Scheduling Problem with Total Tardiness," Computers and Operations Research, 16, 333-340 (1989).