A note on scheduling hybrid flow systems

DOI10.1080/002075497195434MaRDI QIDQ4252131zbMATH OpenOpenAlexFDO

Authors

Publication date 9 September 1999

Published in International Journal of Production Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/002075497195434

zbMATH Keywords

hybrid flow shopminimum deviationschedulingshortest processing time

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Recommendations

• A comparison of sequencing rules in static and dynamic hybrid flow systems
• Comparison of Scheduling Rules in a Flow Shop with Multiple Processors: A Simulation
• On the Asymptotic Optimality of the SPT Rule for the Flow Shop Average Completion Time Problem
• A survey and evaluation of static flowshop scheduling heuristics
• The Asymptotic Optimality of the SPT Rule for the Flow Shop Mean Completion Time Problem

Cited in

(5)

• Some remarks about the `equivalence' of performance measures in scheduling problems
• Minimizing makespan in a two-stage hybrid flow shop scheduling problem with open shop in one stage
• The hybrid flow shop scheduling problem
• Review and classification of hybrid flow shop scheduling problems from a production system and a solutions procedure perspective
• A comparison of sequencing rules in static and dynamic hybrid flow systems

This page was built for publication: A note on scheduling hybrid flow systems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4252131)