Complexity of the project scheduling problem with credits

DOI10.1134/S1990478915040055zbMath1349.90362MaRDI QIDQ3186838

E. A. Kazakovtseva, Vladimir V. Servakh

Publication date: 12 August 2016

Published in: Journal of Applied and Industrial Mathematics (Search for Journal in Brave)

zbMATH Keywords

project schedulinginvestment projectcreditingNPV criterion

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Deterministic scheduling theory in operations research (90B35) Resource and cost allocation (including fair division, apportionment, etc.) (91B32) Corporate finance (dividends, real options, etc.) (91G50)

Related Items (2)

Complexity of the project scheduling problem with credits ⋮ Application of idempotent algebra methods in genetic algorithm for solving the scheduling problem

Cites Work

• Financing and reliability analysis for schedules in the project calendar planning problem
• Resource-constrained project scheduling: Notation, classification, models, and methods
• On scheduling credited projects
• Complexity of the project scheduling problem with credits
• Minimizing Costs of Resource Requirements in Project Networks Subject to a Fixed Completion Time
• Cash Flows in Networks
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Complexity of the project scheduling problem with credits