On solvability of the project scheduling problem with accumulative resources of an arbitrary sign

zbMATH Open1162.90453MaRDI QIDQ5301739FDOQ5301739

Authors: Eh. Kh. Gimadi, Sergey Sevastyanov 

Publication date: 20 January 2009

Recommendations

• Polynomially solvable cases of the project scheduling problem with changing consumption and supply rates of nonaccumulative resources
• Complexity of project scheduling problem with nonrenewable resources
• Polynomial algorithms for some scheduling problems with one nonrenewable resource
• Complexity of some project scheduling problem with nonrenewable resources
• scientific article; zbMATH DE number 4095193

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Cited In (6)

• Polynomially solvable cases of the project scheduling problem with changing consumption and supply rates of nonaccumulative resources
• On scheduling credited projects
• A 3/2-approximation for big two-bar charts packing
• Two-bar charts packing problem
• Financing and reliability analysis for schedules in the project calendar planning problem
• Complexity of the project scheduling problem with credits

This page was built for publication: On solvability of the project scheduling problem with accumulative resources of an arbitrary sign

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