Two-stage proportionate flexible flow shop to minimize the makespan

DOI10.1007/S10878-011-9423-1zbMath1268.90017OpenAlexW2041272764MaRDI QIDQ1945694

Kangbok Lee, Byung-Cheon Choi

Publication date: 8 April 2013

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-011-9423-1

zbMATH Keywords

computational complexityschedulingapproximation algorithmproportionate flexible flow shop

Mathematics Subject Classification ID

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

Related Items (3)

Improved approximation algorithms for two-stage flexible flow shop scheduling ⋮ An approximation algorithm for proportionate scheduling in the two-stage hybrid flow shop ⋮ Approximation algorithms for two-stage flexible flow shop scheduling

Cites Work

• Unnamed Item
• Preemptive scheduling in a two-stage multiprocessor flow shop is NP-hard
• Minimizing total weighted completion time in a proportionate flow shop
• A hybrid three-stage flowshop problem: Efficient heuristics to minimize makespan
• Minimizing makespan in hybrid flowshops
• A new heuristic for minimal makespan in flow shops with multiple processors and no intermediate storage.
• A polynomial time approximation scheme for the two-stage multiprocessor flow shop problem
• The hybrid flow shop scheduling problem
• Review and classification of hybrid flow shop scheduling problems from a production system and a solutions procedure perspective
• Focused Scheduling in Proportionate Flowshops
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey

This page was built for publication: Two-stage proportionate flexible flow shop to minimize the makespan