Scheduling hybrid flowshops to minimize maximum tardiness or maximum completion time
- 1 June 1996
- journal article
- research article
- Published by Taylor & Francis Ltd in International Journal of Production Research
- Vol. 34 (6), 1643-1654
- https://doi.org/10.1080/00207549608904988
Abstract
The problem of scheduling independent jobs on several serial workshops consisting of identical parallel machines is studied. Each job is processed by one machine in each workshop. This workshop environment is called a hybrid Flowshop. Each job has its own due-date and the objective is to minimize maximum tardiness or maximum completion time. Given that the problem is NP-hard, a set of list algorithms is developed to solve it. To evaluate the quality of these heuristics, lower bounds on the optimal solution have been derived and compared to the value of the heuristics on 1920 problems. Our results indicate that a heuristic based on Nawaz et al. (1983) method outperformed the other approaches.Keywords
This publication has 26 references indexed in Scilit:
- Minimizing makespan in hybrid flowshopsOperations Research Letters, 1994
- Comparative performance analysis of priority rules in a constrained flow shop with multiple processors environmentEuropean Journal of Operational Research, 1994
- Schedules for a two-stage hybrid flowshop with parallel machines at the second stageInternational Journal of Production Research, 1991
- A state-of-the-art review of parallel-machine scheduling researchEuropean Journal of Operational Research, 1990
- Interstage Transportation Planning in the Deterministic Flow-Shop EnvironmentOperations Research, 1987
- Scheduling open shops with parallel machinesOperations Research Letters, 1982
- Minimizing maximum lateness in a two-machine unit-time job shopComputing, 1981
- Evaluation of a Heuristic for Scheduling Independent Jobs on Parallel Identical ProcessorsManagement Science, 1979
- A Heuristic Algorithm for the n Job, m Machine Sequencing ProblemManagement Science, 1970
- Optimal two‐ and three‐stage production schedules with setup times includedNaval Research Logistics Quarterly, 1954