Complexity of some project scheduling problem with nonrenewable resources
From MaRDI portal
Publication:2885271
zbMATH Open1249.90077MaRDI QIDQ2885271FDOQ2885271
Authors: 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
Cited In (13)
- Polynomial algorithms for some scheduling problems with one nonrenewable resource
- Polynomially solvable cases of the project scheduling problem with changing consumption and supply rates of nonaccumulative resources
- Complexity of the Project Sequencing Problem
- On the complexity of project scheduling to minimize exposed time
- On scheduling credited projects
- On the calendar planning problem with renewable resource
- On solvability of the project scheduling problem with accumulative resources of an arbitrary sign
- The next release problem: complexity, exact algorithms and computations
- Complexity of project scheduling problem with nonrenewable resources
- Financing and reliability analysis for schedules in the project calendar planning problem
- Project Scheduling Under Partially Renewable Resource Constraints
- Resource allocation by means of project networks: complexity results
- 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)
