Polynomially solvable cases of the project scheduling problem with changing consumption and supply rates of nonaccumulative resources
zbMath1338.90192MaRDI QIDQ278540
Julia Viktorovna Kovalenko, Anton Valentinovich Eremeev
Publication date: 2 May 2016
Published in: Izvestiya Irkutskogo Gosudarstvennogo Universiteta. Seriya Matematika (Search for Journal in Brave)
Full work available at URL: http://isu.ru/journal/downloadArticle?article=_bb3b5271ee524fa0a6f83d9a3f376da0&lang=rus
project schedulingdynamic programmingnonaccumulative resourcespolynomial solvabilitypseudo-polynomial solvability
Approximation methods and heuristics in mathematical programming (90C59) Stochastic scheduling theory in operations research (90B36) Complexity and performance of numerical algorithms (65Y20)
Cites Work
- Polynomial algorithms for resource-constrained and multiprocessor task scheduling problems
- A branch and bound algorithm for the resource-constrained project scheduling problem
- Project scheduling with resource constraints: A branch and bound approach. Note by Frederik Kaefer
- NP-hardness of shop-scheduling problems with three jobs
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Polynomially solvable cases of the project scheduling problem with changing consumption and supply rates of nonaccumulative resources
