Two‐machine flowshop scheduling with conditional deteriorating second operations

DOI10.1111/j.1475-3995.2006.00536.xzbMath1127.90031OpenAlexW1990565883MaRDI QIDQ5488249

Cheng, T. C. Edwin, Bertrand M. T. Lin

Publication date: 14 September 2006

Published in: International Transactions in Operational Research (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/10397/645

zbMATH Keywords

waiting timemakespanflowshop scheduling\(\mathcal {NP}\)-hardness

Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60) Deterministic scheduling theory in operations research (90B35)

Related Items (6)

Relocation scheduling subject to fixed processing sequences ⋮ Permutation flowshop manufacturing cell scheduling problems with deteriorating jobs and sequence dependent setup times under dominant machines ⋮ Total completion time minimization in a \(2\)-stage differentiation flowshop with fixed sequences per job type ⋮ Total completion time minimization in two-machine flow shop scheduling problems with a fixed job sequence ⋮ Scheduling with centralized and decentralized batching policies in concurrent open shops ⋮ The Browne-Yechiali single-machine sequence is optimal for flow-shops

Cites Work

• A concise survey of scheduling with time-dependent processing times
• Unnamed Item

This page was built for publication: Two‐machine flowshop scheduling with conditional deteriorating second operations