Minimizing total tardiness in permutation flowshops
Author:
- Yeong-Dae KimYKYeong-Dae Kim
- 1 September 1995
- journal article
- Published by Elsevier in European Journal of Operational Research
- Vol. 85 (3) , 541-555
Abstract
No abstract availableKeywords
This publication has 22 references indexed in Scilit:
- The Lessons of Flowshop Scheduling ResearchOperations Research, 1992
- Minimizing Total Tardiness on One Machine is NP-HardMathematics of Operations Research, 1990
- A new integer programming formulation for the permutation flowshop problemEuropean Journal of Operational Research, 1989
- Generating improved dominance conditions for the flowshop problemComputers & Operations Research, 1987
- On Flow Shop Scheduling with Release and Due Dates to Minimize Maximum LatenessJournal of the Operational Research Society, 1983
- Four simple heuristics for scheduling a flow-shopInternational Journal of Production Research, 1978
- A New Bound for Machine SchedulingJournal of the Operational Research Society, 1976
- The Complexity of Flowshop and Jobshop SchedulingMathematics of Operations Research, 1976
- Application of the Branch and Bound Technique to Some Flow-Shop Scheduling ProblemsOperations Research, 1965
- Optimal two‐ and three‐stage production schedules with setup times includedNaval Research Logistics Quarterly, 1954