A flexible flowshop problem with total flow time minimization
- 1 August 2001
- journal article
- Published by Elsevier BV in European Journal of Operational Research
- Vol. 132 (3), 528-538
- https://doi.org/10.1016/s0377-2217(00)00142-9
Abstract
No abstract availableKeywords
This publication has 22 references indexed in Scilit:
- Scheduling hybrid flowshops to minimize maximum tardiness or maximum completion timeInternational Journal of Production Research, 1996
- Scheduling a two-stage hybrid flowshop with separable setup and removal timesEuropean Journal of Operational Research, 1994
- Textile Production Systems: a Succession of Non-identical Parallel Processor ShopsJournal of the Operational Research Society, 1991
- Schedules for a two-stage hybrid flowshop with parallel machines at the second stageInternational Journal of Production Research, 1991
- A new heuristic for the n-job, M-machine flow-shop problemEuropean Journal of Operational Research, 1991
- Branch and bound algorithm for the flow shop with multiple processorsEuropean Journal of Operational Research, 1991
- Improved lower bounds for minimizing the sum of completion times of n jobs over m machines in a flow shopEuropean Journal of Operational Research, 1990
- Two-Stage, Hybrid Flowshop Scheduling ProblemJournal of the Operational Research Society, 1988
- Minimizing the Sum of Completion Times of n Jobs over m Machines in a Flowshop—A Branch and Bound ApproachA I I E Transactions, 1977
- The Complexity of Flowshop and Jobshop SchedulingMathematics of Operations Research, 1976