Scheduling algorithms to minimize the number of tardy jobs in two-stage hybrid flow shops
- 28 February 2009
- journal article
- Published by Elsevier BV in Computers & Industrial Engineering
- Vol. 56 (1), 113-120
- https://doi.org/10.1016/j.cie.2008.04.005
Abstract
No abstract availableKeywords
This publication has 19 references indexed in Scilit:
- A flexible flowshop problem with total flow time minimizationEuropean Journal of Operational Research, 2001
- Minimizing tardy jobs in a two-stage hybrid flowshopInternational Journal of Production Research, 1998
- A hybrid three-stage flowshop problem: Efficient heuristics to minimize makespanEuropean Journal of Operational Research, 1998
- Tardiness minimization on parallel machinesInternational Journal of Production Economics, 1998
- Scheduling hybrid flowshops to minimize maximum tardiness or maximum completion timeInternational Journal of Production Research, 1996
- Minimizing the number of tardy jobs for m parallel machinesEuropean Journal of Operational Research, 1995
- Analysis of Classes of Heuristics for Scheduling a Two-Stage Flow Shop with Parallel Machines at One StageJournal of the Operational Research Society, 1995
- Schedules for a two-stage hybrid flowshop with parallel machines at the second stageInternational Journal of Production Research, 1991
- Branch and bound algorithm for the flow shop with multiple processorsEuropean Journal of Operational Research, 1991
- Two-Stage, Hybrid Flowshop Scheduling ProblemJournal of the Operational Research Society, 1988