Project scheduling with calendars

OR Spektrum

Volumn 23, Issue 3, 2001, Pages 325-334

  Franck, Birger ^a   Neumann, Klaus ^a   Schwindt, Christoph ^a  

^a UNIVERSITY OF KARLSRUHE   (Germany)

Author keywords

Minimum and maximum time lags; Priority rule methods; Project scheduling calendars

Indexed keywords

EID: 0442311836     PISSN: 01716468     EISSN: None     Source Type: Journal    
DOI: 10.1007/PL00013355     Document Type: Article

References (8)

1. Bartusch M, Möhring RH, Radermacher FJ (1988) Scheduling project networks with resource constraints and time windows. Annals of Operations Research 16:201-240
2. Brucker P (2001) Scheduling Algorithms. Springer, Berlin Heidelberg New York
3. Franck B (1999) Prioritätsregelverfahren für die ressourcenbeschränkte Projektplanung mit und ohne Kalender. Shaker, Aachen
4. Franck B, Neumann K, Schwindt C (2001) Truncated branch-and-bound, schedule-construction, and schedule-improvement procedures for resource-constrained project scheduling. OR Spektrum 23: 297-324 (this issue)
5. Neumann K, Schwindt C (1997) Activity-on-node networks with minimal and maximal time-lags and their application to make-to-order production. OR Spektrum 19:205-217
6. Neumann K, Schwindt C, Trautmann N (2001) Short-term planning of batch plants in process industries. In: Kischka P, Leopold-Wildburger U, Möhring RH, Radermacher FJ (eds.) Models, methods and decision support for management, pp. 211-226. Physica, Heidelberg
7. Schwindt C, Trautmann N (2000) Batch scheduling in process industries: An application of resource-constrained project scheduling. OR Spektrum 22:501-524
8. Zhan J (1992) Calendarization of time-planning in MPM networks. ZOR - Methods and Models of Operations Research 36:423-438