The Discrete Resource Allocation Problem in Flow Lines

DOI10.1287/MNSC.41.9.1417zbMath0861.90074OpenAlexW2025807874MaRDI QIDQ4717388

Selçuk Karabatı, Gang Yu, Panagiotis Kouvelis

Publication date: 1 December 1996

Published in: Management Science (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/11693/48997

zbMATH Keywords

implicit enumerationflow shop schedulingsurrogate relaxationacyclic directed graphsdeterministic flow linediscrete resource allocation problemsimultaneous scheduling and resource allocation

Mathematics Subject Classification ID

Integer programming (90C10) Deterministic scheduling theory in operations research (90B35)

This page was built for publication: The Discrete Resource Allocation Problem in Flow Lines