Three-Machine Flowshop Scheduling Problem to Minimize Total Completion Time with Bounded Setup and Processing Times

DOI10.7494/dmms.2007.1.2.5zbMath1231.90171OpenAlexW1575992136WikidataQ129524974 ScholiaQ129524974MaRDI QIDQ3011180

Ali Allahverdi

Publication date: 28 June 2011

Published in: Decision Making in Manufacturing and Services (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.7494/dmms.2007.1.2.5

zbMATH Keywords

schedulingflowshopdominance relationsbounded processing and setup times

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (1)

The third comprehensive survey on scheduling problems with setup times/costs

This page was built for publication: Three-Machine Flowshop Scheduling Problem to Minimize Total Completion Time with Bounded Setup and Processing Times