The three-machine proportionate flow shop problem with unequal machine speeds

DOI10.1016/S0167-6377(02)00232-8zbMath1013.90068MaRDI QIDQ1811632

Sixiang Hou, Hoogeveen, J. A.

Publication date: 17 June 2003

Published in: Operations Research Letters (Search for Journal in Brave)

zbMATH Keywords

dynamic programmingmakespanNP-hardnessproportionate flow shopmachine speedsordered processing timesV-shaped

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (13)

Minimizing maximum completion time in a proportionate flow shop with one machine of different speed ⋮ An \(O(n^{2})\) algorithm for the variable common due date, minimal tardy jobs bicriteria two-machine flow shop problem with ordered machines ⋮ 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 ⋮ A note: Maximizing the weighted number of just-in-time jobs on a proportionate flowshop ⋮ Online scheduling of ordered flow shops ⋮ Makespan minimization for the \(m\)-machine ordered flow shop scheduling problem ⋮ Flow shops with machine maintenance: ordered and proportionate cases ⋮ Flow shops with reentry: reversibility properties and makespan optimal schedules ⋮ Three-stage ordered flow shops with either synchronous flow, blocking or no-idle machines ⋮ Minimizing the total weighted completion time in a two-machine proportionate flow shop with different machine speeds ⋮ Proportionate flow shop: New complexity results and models with due date assignment

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Minimizing total weighted completion time in a proportionate flow shop
• Focused Scheduling in Proportionate Flowshops
• A Note on Stochastic Shop Models in Which Jobs have the Same Processing Requirements on Each Machine
• Flowshop Sequencing Problem with Ordered Processing Time Matrices
• Flowshop sequencing problem with ordered processing time matrices: A general case
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey

This page was built for publication: The three-machine proportionate flow shop problem with unequal machine speeds