Complexity of project scheduling problem with nonrenewable resources

DOI10.1007/978-3-540-77903-2_66MaRDI QIDQ5391960zbMATH OpenOpenAlexFDO

Authors T. A. Shcherbinina, V. V. Servakh

Publication date 7 April 2011

Published in Operations Research Proceedings (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-77903-2_66

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Theory of organizations, manpower planning in operations research (90B70)

Recommendations

• Complexity of some project scheduling problem with nonrenewable resources
• On project scheduling problem
• Project Scheduling Under Partially Renewable Resource Constraints
• scientific article; zbMATH DE number 175998
• scientific article; zbMATH DE number 3891075

Cites work

• Complexity Results for Multiprocessor Scheduling under Resource Constraints
• scientific article; zbMATH DE number 3471786 (Why is no real title available?)
• scientific article; zbMATH DE number 1560545 (Why is no real title available?)
• Reducibility among combinatorial problems

Cited in

(5)

• On the complexity of project scheduling to minimize exposed time
• 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
• Project Scheduling Under Partially Renewable Resource Constraints
• On solvability of the project scheduling problem with accumulative resources of an arbitrary sign

This page was built for publication: Complexity of project scheduling problem with nonrenewable resources

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