Minimizing total completion time in two-stage hybrid flow shop with dedicated machines

DOI10.1016/J.COR.2010.10.009zbMath1205.90140OpenAlexW2089830689MaRDI QIDQ622160

Jaehwan Yang

Publication date: 31 January 2011

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

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

zbMATH Keywords

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

Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (4)

Solving distributed two-stage hybrid flowshop scheduling using a shuffled frog-leaping algorithm with memeplex grouping ⋮ 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 ⋮ A heuristic method for 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
• Minimizing Total Completion Time in a Two-Machine Flowshop: Analysis of Special Cases
• A new complexity proof for the two-stage hybrid flow shop scheduling problem with dedicated machines
• Flowshop and Jobshop Schedules: Complexity and Approximation
• The Complexity of Flowshop and Jobshop Scheduling
• 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: Minimizing total completion time in two-stage hybrid flow shop with dedicated machines