An Algorithm for Project (Job) Sequencing with Resource Constraints

DOI10.1287/OPRE.20.4.835MaRDI QIDQ5652440zbMATH OpenOpenAlexFDO

Authors Samuel Gorenstein

Publication date 1972

Published in Operations Research (Search for Journal in Brave)

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

Mathematics Subject Classification ID

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

Cited in

(5)

• An algorithm for generating all maximal independent subsets of posets
• Project scheduling with resource constraints: A branch and bound approach. Note by Frederik Kaefer
• Hierarchical models for multi-project planning and scheduling
• Resource-constrained project scheduling by simulated annealing
• Mixed multigraph approach to scheduling jobs on machines of different types^∗

This page was built for publication: An Algorithm for Project (Job) Sequencing with Resource Constraints

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