Scheduling Resource-Constrained Projects Competitively at Modest Memory Requirements
Year of publication: |
2000
|
---|---|
Authors: | Sprecher, Arno |
Published in: |
Management Science. - Institute for Operations Research and the Management Sciences - INFORMS, ISSN 0025-1909. - Vol. 46.2000, 5, p. 710-723
|
Publisher: |
Institute for Operations Research and the Management Sciences - INFORMS |
Subject: | project scheduling | resource constraints | single-mode | branch-and-bound | heuristic | computational results |
-
Solving the RCPSP efficiently at modest memory requirements
Sprecher, Arno, (1996)
-
Solving the RCPSP efficiently at modest memory requirements
Sprecher, Arno, (1996)
-
A competitive exact algorithm for assembly line balancing
Sprecher, Arno, (1997)
- More ...
-
Minimal delaying alternatives and semi-active timetabling in resource-constrained project scheduling
Sprecher, Arno, (1996)
-
Non-equivalent search strategies for resource-constrained project scheduling
Sprecher, Arno, (1998)
-
Network decomposition techniques for resource-constrained project scheduling
Sprecher, Arno, (1999)
- More ...