A two-stage hybrid flow shop with dedicated machines at the first stage

DOI10.1016/j.cor.2013.05.020zbMath1348.90332OpenAlexW2049561666MaRDI QIDQ336642

Jaehwan Yang

Publication date: 10 November 2016

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2013.05.020

zbMATH Keywords

computational complexityheuristictwo-stage hybrid flow shopworst case bound on the relative error

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)

Related Items

Minimizing total completion time in a two-stage hybrid flow shop with dedicated machines at the first stage, Survey and extensions of manufacturing models in two-stage flexible flow shops with dedicated machines, On the two-stage hybrid flow shop with dedicated machines, A two-stage flow shop scheduling problem with transportation considerations

Cites Work

• Minimizing total completion time in two-stage hybrid flow shop with dedicated machines
• Branch and bound algorithm for the flow shop with multiple processors
• The strong NP-hardness of two-stage flowshop scheduling with a common second-stage machine
• Minimizing makespan in hybrid flowshops
• Scheduling a two-stage hybrid flow shop with parallel machines at the first stage
• Two-stage flowshop scheduling with a common second-stage machine
• 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 two-stage hybrid flowshop scheduling problem with a function constraint and unrelated alternative machines
• A HYBRID TWO-STAGE FLOWSHOP SCHEDULING PROBLEM
• The Complexity of Flowshop and Jobshop Scheduling
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey