A note on the proportionate flow shop with a bottleneck machine

DOI10.1016/j.ejor.2008.01.031zbMath1176.90225OpenAlexW1980763491MaRDI QIDQ958116

Christos P. Koulamas, Kyparisis, George J.

Publication date: 2 December 2008

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2008.01.031

zbMATH Keywords

makespanapproximation algorithmsproportionate flow shopflow shop sequencing

Mathematics Subject Classification ID

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

Related Items (4)

Minimizing makespan in an ordered flow shop with machine-dependent processing times ⋮ Two-machine flow shop scheduling problem with an outsourcing option ⋮ A note on makespan minimization in proportionate flow shops ⋮ Flow shops with machine maintenance: ordered and proportionate cases

Cites Work

• Minimizing maximum completion time in a proportionate flow shop with one machine of different speed
• Flowshop Sequencing Problem with Ordered Processing Time Matrices

This page was built for publication: A note on the proportionate flow shop with a bottleneck machine