Minimizing the makespan in the two-machine flowshop scheduling problem with an availability constraint
Author:
- 1 March 1997
- journal article
- Published by Elsevier in Operations Research Letters
- Vol. 20 (3) , 129-139
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- Machine scheduling with an availability constraintJournal of Global Optimization, 1996
- Minimizing makespan in hybrid flowshopsOperations Research Letters, 1994
- A Polynomial Approximation Scheme for a Constrained Flow-Shop Scheduling ProblemMathematics of Operations Research, 1994
- Capacitated two-parallel machines scheduling to minimize sum of job completion timesDiscrete Applied Mathematics, 1993
- Single machine flow-time scheduling with scheduled maintenanceActa Informatica, 1992
- The Lessons of Flowshop Scheduling ResearchOperations Research, 1992
- Parallel machines scheduling with nonsimultaneous machine available timeDiscrete Applied Mathematics, 1991
- Single machine flow-time scheduling with a single breakdownActa Informatica, 1989
- The Complexity of Flowshop and Jobshop SchedulingMathematics of Operations Research, 1976
- Optimal two‐ and three‐stage production schedules with setup times includedNaval Research Logistics Quarterly, 1954