On equivalence between the proportionate flow shop and single‐machine scheduling problems

DOI10.1002/nav.21666zbMath1411.90155OpenAlexW2467205258MaRDI QIDQ4632911

Christos P. Koulamas, Shrikant S. Panwalkar

Publication date: 2 May 2019

Published in: Naval Research Logistics (NRL) (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/nav.21666

zbMATH Keywords

flow shopsingle-machineproportionate

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (6)

Due-window assignment scheduling in the proportionate flow shop setting ⋮ Proportionate flowshop scheduling with position-dependent weights ⋮ The proportionate flow shop total tardiness problem ⋮ Study on proportionate flowshop scheduling with due-date assignment and position-dependent weights ⋮ Improved algorithms for proportionate flow shop scheduling with due-window assignment ⋮ A note on study on proportionate flowshop scheduling with due-date assignment and position-dependent weights

This page was built for publication: On equivalence between the proportionate flow shop and single‐machine scheduling problems