Providing Lower Bounds for the Multi-Mode Resource-Constrained Project Scheduling Problem

Christian Stürck () and Patrick Gerhards ()
Additional contact information
Christian Stürck: Helmut Schmidt University
Patrick Gerhards: Helmut Schmidt University

A chapter in Operations Research Proceedings 2016, 2018, pp 551-557 from Springer

Abstract: Abstract We present lower bounds (LB) for the multi-mode resource-constrained project scheduling problem (MRCPSP). Traditionally, the LB for the MRCPSP are derived from the critical path method (CPM). Here, the mode with the shortest duration of each activity is chosen. We improve these LB. New earliest starting times (EST) are calculated by solving several integer programs with a standard solver. These new EST partially improve the EST calculated by the critical path method. This also reduces the number of variables in the model and, in the best case, proves optimality of the best known solutions. Computational results show that these new starting times provide a tighter bound than the LB obtained from CPM.

Date: 2018
References: Add references at CitEc
Citations: View citations in EconPapers (1)

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:oprchp:978-3-319-55702-1_73

Ordering information: This item can be ordered from
http://www.springer.com/9783319557021

DOI: 10.1007/978-3-319-55702-1_73

Access Statistics for this chapter

More chapters in Operations Research Proceedings from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().