A new complexity proof for the two-stage hybrid flow shop scheduling problem with dedicated machines

DOI10.1080/00207540802691374zbMath1197.90240OpenAlexW2403675486MaRDI QIDQ3163722

Jaehwan Yang

Publication date: 26 October 2010

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

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

zbMATH Keywords

computational complexityschedulinghybrid flow shop

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (2)

A heuristic method for two-stage hybrid flow shop with dedicated machines ⋮ Minimizing total completion time in two-stage hybrid flow shop with dedicated machines

Cites Work

• Unnamed Item
• Branch and bound algorithm for the flow shop with multiple processors
• Minimizing makespan in hybrid flowshops
• Scheduling a two-stage hybrid flow shop with parallel machines at the first stage
• Optimal two- and three-stage production schedules with setup times included
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Sequencing a hybrid two-stage flowshop with dedicated machines

This page was built for publication: A new complexity proof for the two-stage hybrid flow shop scheduling problem with dedicated machines