Scheduling subject to nonrenewable-resource constraints
From MaRDI portal
Publication:1169397
DOI10.1016/0167-6377(82)90045-1zbMath0494.90041MaRDI QIDQ1169397
Publication date: 1982
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0167-6377(82)90045-1
polynomial time algorithm; precedence constrained scheduling; depletion time dependant job cost; minimal makespan; minimization of maximum cost; nonrenewable-resource constraints
68Q25: Analysis of algorithms and problem complexity
90B35: Deterministic scheduling theory in operations research