A new branch and bound algorithm for project scheduling with resource constraints
Applicationes Mathematicae (1991)
- Volume: 21, Issue: 2, page 273-282
- ISSN: 1233-7234
Access Full Article
topHow to cite
topScheithauer, G., and Terno, J.. "A new branch and bound algorithm for project scheduling with resource constraints." Applicationes Mathematicae 21.2 (1991): 273-282. <http://eudml.org/doc/263300>.
@article{Scheithauer1991,
author = {Scheithauer, G., Terno, J.},
journal = {Applicationes Mathematicae},
keywords = {branch-and-bound algorithm; precedence and resource constrained scheduling; project networks; lower bound},
language = {eng},
number = {2},
pages = {273-282},
title = {A new branch and bound algorithm for project scheduling with resource constraints},
url = {http://eudml.org/doc/263300},
volume = {21},
year = {1991},
}
TY - JOUR
AU - Scheithauer, G.
AU - Terno, J.
TI - A new branch and bound algorithm for project scheduling with resource constraints
JO - Applicationes Mathematicae
PY - 1991
VL - 21
IS - 2
SP - 273
EP - 282
LA - eng
KW - branch-and-bound algorithm; precedence and resource constrained scheduling; project networks; lower bound
UR - http://eudml.org/doc/263300
ER -
NotesEmbed ?
topTo embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.