Technical Note—An Improved Feasibility Test for Gorenstein's Algorithm

DOI10.1287/OPRE.22.5.1117MaRDI QIDQ4047427zbMATH OpenOpenAlexFDO

Authors G. E. Bennington, Leon F. McGinnis

Publication date 1974

Published in Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1287/opre.22.5.1117

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Deterministic scheduling theory in operations research (90B35)

Cited in

(1)

• Project scheduling with resource constraints: A branch and bound approach. Note by Frederik Kaefer

This page was built for publication: Technical Note—An Improved Feasibility Test for Gorenstein's Algorithm

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4047427)