Solving the RCPSP efficiently at modest memory requirements
Year of publication: |
1996
|
---|---|
Authors: | Sprecher, Arno |
Publisher: |
Kiel : Inst. für Betriebswirtschaftslehre |
Subject: | Project Scheduling | Resource Constraints | Single-Mode | Branch-and-Bound | Heuristic | Computational Results | Scheduling-Verfahren | Scheduling problem | Projektmanagement | Project management | Theorie | Theory | Heuristik | Heuristics | Engpass | Bottleneck | Mathematische Optimierung | Mathematical programming | Branch and Bound |
-
Sprecher, Arno, (1996)
-
Sprecher, Arno, (1996)
-
A competitive exact algorithm for assembly line balancing
Sprecher, Arno, (1997)
- More ...
-
Solving the RCPSP efficiently at modest memory requirements
Sprecher, Arno, (1996)
-
A competitive exact algorithm for assembly line balancing
Sprecher, Arno, (1997)
-
Minimal delaying alternatives and semi-active timetabling in resource-constrained project scheduling
Sprecher, Arno, (1996)
- More ...