### Abstract

Original language | Undefined |
---|---|

Pages | 139-150 |

Number of pages | 12 |

DOIs | |

State | Published - 1999 |

### Fingerprint

### Keywords

- EWI-12244
- IR-62242

### Cite this

*Resource-constrained project scheduling: computing lower bounds by solving minimum cut problems*. 139-150. DOI: 10.1007/3-540-48481-7_13

}

**Resource-constrained project scheduling: computing lower bounds by solving minimum cut problems.** / Möhring, R.H.; Nesetril, J. (Editor); Schulz, A.S.; Stork, F.; Uetz, Marc Jochen.

Research output: Scientific - peer-review › Paper

TY - CONF

T1 - Resource-constrained project scheduling: computing lower bounds by solving minimum cut problems

AU - Möhring,R.H.

AU - Schulz,A.S.

AU - Stork,F.

AU - Uetz,Marc Jochen

A2 - Nesetril,J.

PY - 1999

Y1 - 1999

N2 - We present a novel approach to compute Lagrangian lower bounds on the objective function value of a wide class of resource-constrained project scheduling problems. The basis is a polynomial-time algorithm to solve the following scheduling problem: Given a set of activities with start-time dependent costs and temporal constraints in the form of time windows, find a feasible schedule of minimum total cost. In fact, we show that any instance of this problem can be solved by a minimum cut computation in a certain directed graph. We then discuss the performance of the proposed Lagrangian approach when applied to various types of resource-constrained project scheduling problems. An extensive computational study based on different established test beds in project scheduling shows that it can significantly improve upon the quality of other comparably fast computable lower bounds.

AB - We present a novel approach to compute Lagrangian lower bounds on the objective function value of a wide class of resource-constrained project scheduling problems. The basis is a polynomial-time algorithm to solve the following scheduling problem: Given a set of activities with start-time dependent costs and temporal constraints in the form of time windows, find a feasible schedule of minimum total cost. In fact, we show that any instance of this problem can be solved by a minimum cut computation in a certain directed graph. We then discuss the performance of the proposed Lagrangian approach when applied to various types of resource-constrained project scheduling problems. An extensive computational study based on different established test beds in project scheduling shows that it can significantly improve upon the quality of other comparably fast computable lower bounds.

KW - EWI-12244

KW - IR-62242

U2 - 10.1007/3-540-48481-7_13

DO - 10.1007/3-540-48481-7_13

M3 - Paper

SP - 139

EP - 150

ER -