An Algorithm for Project (Job) Sequencing with Resource Constraints
From MaRDI portal
Publication:5652440
DOI10.1287/opre.20.4.835zbMath0241.90030OpenAlexW2045201383MaRDI QIDQ5652440
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
Programming involving graphs or networks (90C35) Deterministic scheduling theory in operations research (90B35)
Related Items (5)
Hierarchical models for multi-project planning and scheduling ⋮ An algorithm for generating all maximal independent subsets of posets ⋮ Mixed multigraph approach to scheduling jobs on machines of different types∗ ⋮ Project scheduling with resource constraints: A branch and bound approach. Note by Frederik Kaefer ⋮ Resource-constrained project scheduling by simulated annealing
This page was built for publication: An Algorithm for Project (Job) Sequencing with Resource Constraints
