Geodesic
Complexity of some project scheduling problem with nonrenewable resources
Sibirskij žurnal čistoj i prikladnoj matematiki, Tome 8 (2008) no. 3, pp. 105-112

Voir la notice de l'article provenant de la source Math-Net.Ru

In this paper the project scheduling problem with nonreneawble resources and criterion of Net Present Value is considered. We prove that this problem is strongly $NP$-hard. Special case of independent jobs was investigated. We propose the exact algorithm for this case of the problem which is based on dynamic programming scheme. We obtain the cases of the problem when the algorithm became pseudopolynomial. 
@article{VNGU_2008_8_3_a6,
     author = {V. V. Servakh and T. A. Shcherbinina},
     title = {Complexity of some project scheduling problem with nonrenewable resources},
     journal = {Sibirskij \v{z}urnal \v{c}istoj i prikladnoj matematiki},
     pages = {105--112},
     publisher = {mathdoc},
     volume = {8},
     number = {3},
     year = {2008},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/VNGU_2008_8_3_a6/}
}
TY  - JOUR
AU  - V. V. Servakh
AU  - T. A. Shcherbinina
TI  - Complexity of some project scheduling problem with nonrenewable resources
JO  - Sibirskij žurnal čistoj i prikladnoj matematiki
PY  - 2008
SP  - 105
EP  - 112
VL  - 8
IS  - 3
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/VNGU_2008_8_3_a6/
LA  - ru
ID  - VNGU_2008_8_3_a6
ER  - 
%0 Journal Article
%A V. V. Servakh
%A T. A. Shcherbinina
%T Complexity of some project scheduling problem with nonrenewable resources
%J Sibirskij žurnal čistoj i prikladnoj matematiki
%D 2008
%P 105-112
%V 8
%N 3
%I mathdoc
%U http://geodesic.mathdoc.fr/item/VNGU_2008_8_3_a6/
%G ru
%F VNGU_2008_8_3_a6
V. V. Servakh; T. A. Shcherbinina. Complexity of some project scheduling problem with nonrenewable resources. Sibirskij žurnal čistoj i prikladnoj matematiki, Tome 8 (2008) no. 3, pp. 105-112. http://geodesic.mathdoc.fr/item/VNGU_2008_8_3_a6/