An assignment-based continuous-time MILP model for the resource-constrained project scheduling problem

Rihm, Tom; Trautmann, Norbert (10 December 2017). An assignment-based continuous-time MILP model for the resource-constrained project scheduling problem. In: Proceedings of the 2017 IEEE International Conference on Industrial Engineering and Engineering Management. Singapore. 10.-13.12.2017. 10.1109/IEEM.2017.8289846

Text An assignment-based continuous-time MILP model for the resource-constrained project scheduling problem.pdf - Published Version Restricted to registered users only Available under License Publisher holds Copyright. Download (300kB) | Request a copy

The widely studied resource-constrained project scheduling problem consists of determining the start times for a set of precedence-related project activities requiring time and scarce resources during execution such that the total project duration is minimized. In the literature, in addition to a large variety of specific solution approaches, various mixed-integer linear programming (MILP) models have been proposed for this problem. We present a novel MILP model that is based on explicit assignment and sequencing variables; we enhance the performance of the model by eliminating some symmetric solutions from the search space and by modifying the sequencing constraints for pairs of activities that cannot be processed in parallel. Our computational results for four standard test sets from the literature indicate that this novel model outperforms two state-of-the-art models, particularly when resources are very scarce.

Interest & Impact

Downloads

2 since deposited on 04 Apr 2018
0 in the past 12 months

Citations

5 Citations in Web of Science ®
6 Citations in Scopus

Search

in Google Scholar™

Services

Actions (login required)

Edit item

Actions (login required)

Edit item