A continuous-time unit-based MILP formulation for the resource-constrained project scheduling problem

Gnägi, Mario; Zimmermann, Adrian; Trautmann, Norbert (19 December 2018). A continuous-time unit-based MILP formulation for the resource-constrained project scheduling problem. In: IEEM 2018: IEEE International Conference on Industrial Engineering and Engineering Management. Bangkok. 16.-19.12.2018.

Text unit based.pdf - Published Version Restricted to registered users only Available under License Publisher holds Copyright. Download (232kB)

In the basic resource-constrained project scheduling problem RCPSP, one aims at selecting starting times for the tasks of a project such that the project makespan is minimized and the project schedule is precedence- and resource-feasible. There is a considerable body of
literature about problem-specific solution methods; recently, mixedinteger linear programming (MILP) formulations for the RCPSP have received increasing attention. We suggest a new MILP formulation that utilizes a set of continuous variables indicating the
starting times of the project tasks, and three sets of binary variables indicating the assignment of resource units to the project tasks, the potential overlapping of the project tasks, and the sequencing of the project tasks. In a comparison with ten reference formulations from the literature, it is found that the advantages of this new formulation
are its simple structure, enhanced flexibility, and superior or comparable performance, particularly when the range of the tasks’ durations is relatively high.

Interest & Impact

Downloads

7 since deposited on 22 Jan 2019
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