Complexity of the project scheduling problem with credits
From MaRDI portal
Recommendations
- On scheduling credited projects
- Financing and reliability analysis for schedules in the project calendar planning problem
- scientific article; zbMATH DE number 1985693
- Hybrid algorithm for scheduling with regard for reinvestment of profits
- Complexity of some project scheduling problem with nonrenewable resources
Cites work
- Cash Flows in Networks
- Complexity of some project scheduling problem with nonrenewable resources
- Complexity of the project scheduling problem with credits
- Financing and reliability analysis for schedules in the project calendar planning problem
- scientific article; zbMATH DE number 1560545 (Why is no real title available?)
- Minimizing Costs of Resource Requirements in Project Networks Subject to a Fixed Completion Time
- On scheduling credited projects
- On solvability of the project scheduling problem with accumulative resources of an arbitrary sign
- Resource-constrained project scheduling: Notation, classification, models, and methods
Cited in
(5)- On scheduling credited projects
- Complexity of the project scheduling problem with credits
- Application of idempotent algebra methods in genetic algorithm for solving the scheduling problem
- The problem of planning investment projects with lending
- Financing and reliability analysis for schedules in the project calendar planning problem
This page was built for publication: Complexity of the project scheduling problem with credits
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3186838)