A continuous-time MILP formulation for the multi-mode resource-constrained project scheduling problem

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

Text multi mode.pdf - Published Version Restricted to registered users only Available under License Publisher holds Copyright. Download (249kB) | Request a copy

The well-known multi-mode resource-constrained project scheduling problem aims at selecting for each project task a start time and an execution mode to obtain a precedence and resource-feasible schedule with minimal project duration. The available execution
modes for the tasks differ in their durations and demands for some scarce resources. Numerous problem-specific solution methods and several mixed-integer linear programming (MILP) formulations have been described in the literature. We introduce a new continuous-time MILP formulation that employs continuous start-time variables and
three types of binary variables: mode-selection, resource-assignment and sequencing variables. The results of our computational analysis indicate that the proposed formulation achieves superior performance than two formulations from the literature when the
range of the tasks’ durations is relatively high.

Interest & Impact

Downloads

5 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