Complexity of some project scheduling problem with nonrenewable resources

zbMATH Open1249.90077MaRDI QIDQ2885271FDOQ2885271

T. A. Shcherbinina, V. V. Servakh

Publication date: 21 May 2012

Published in: Vestnik Novosibirskogo Gosudarstvennogo Universiteta. Seriya: Matematika, Mekhanika, Informatika (Search for Journal in Brave)

Recommendations

• Complexity of project scheduling problem with nonrenewable resources
• Single machine scheduling problems with financial resource constraints: some complexity results and properties
• Polynomially solvable cases of the project scheduling problem with changing consumption and supply rates of nonaccumulative resources
• Polynomial algorithms for some scheduling problems with one nonrenewable resource
• Scheduling under a Non-renewable Resource Constraint

zbMATH Keywords

pseudopolynomial algorithmdeterministic project scheduling

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27)

Cited In (7)

• Polynomially solvable cases of the project scheduling problem with changing consumption and supply rates of nonaccumulative resources
• Complexity of the Project Sequencing Problem
• On scheduling credited projects
• On solvability of the project scheduling problem with accumulative resources of an arbitrary sign
• Financing and reliability analysis for schedules in the project calendar planning problem
• Project Scheduling Under Partially Renewable Resource Constraints
• Complexity of the project scheduling problem with credits

This page was built for publication: Complexity of some 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 Q2885271)