Minimizing makespan in a two-stage hybrid flow shop scheduling problem with open shop in one stage

DOI10.1007/s11766-013-3146-2zbMath1299.90139OpenAlexW2114625142MaRDI QIDQ2248262

Jianming Dong, Jueliang Hu, Yong Chen

Publication date: 30 June 2014

Published in: Applied Mathematics. Series B (English Edition) (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11766-013-3146-2

zbMATH Keywords

open shopheuristic algorithmhybrid flow shop

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• A two-stage hybrid flowshop with uniform machines and setup times
• Preemptive scheduling in a two-stage multiprocessor flow shop is NP-hard
• Flowshop scheduling with identical jobs and uniform parallel machines
• Approximation algorithms for the multiprocessor open shop scheduling problem
• Minimizing makespan in hybrid flowshops
• 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 note on makespan minimization in two-stage flexible flow shops with uniform machines
• Optimal two- and three-stage production schedules with setup times included
• Open Shop Scheduling to Minimize Finish Time
• A comparison of sequencing rules in static and dynamic hybrid flow systems
• A note on scheduling hybrid flow systems

This page was built for publication: Minimizing makespan in a two-stage hybrid flow shop scheduling problem with open shop in one stage