Polynomial algorithms for some scheduling problems with one nonrenewable resource

DOI10.1051/RO/2021164MaRDI QIDQ5034755zbMATH OpenOpenAlexFDO

Authors Jacques Carlier, A. Moukrim, Abderrahim Sahli

Publication date 21 February 2022

Published in RAIRO - Operations Research (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1051/ro/2021164

zbMATH Keywords

decomposition methodinterval order graphnonrenewable resourcescheduling problemsseries-parallel graph

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Deterministic scheduling theory in operations research (90B35)

Recommendations

• Complexity of some project scheduling problem with nonrenewable resources
• Scheduling under a Non-renewable Resource Constraint
• scientific article; zbMATH DE number 3894816
• Polynomially solvable cases of the project scheduling problem with changing consumption and supply rates of nonaccumulative resources
• The project scheduling problem with production and consumption of resources: a list-scheduling based algorithm

Cited in

(5)

• Polynomial algorithms for single machine scheduling problems with financial constraints
• Polynomially solvable cases of the project scheduling problem with changing consumption and supply rates of nonaccumulative resources
• Complexity of some project scheduling problem with nonrenewable resources
• scientific article; zbMATH DE number 1560545 (Why is no real title available?)
• On solvability of the project scheduling problem with accumulative resources of an arbitrary sign

This page was built for publication: Polynomial algorithms for some scheduling problems with one nonrenewable resource

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