Resource-Constrained Project Scheduling: Computing Lower Bounds by Solving Minimum Cut Problems

Authors:
Rolf H. Möhring;Andreas S. Schulz;Frederik Stork;Marc Uetz
Affiliations:
-;-;-;-
Venue:
ESA '99 Proceedings of the 7th Annual European Symposium on Algorithms
Year:
1999

Citing 4
Cited 3

An Exact Algorithm for the Resource-Constrained Project Scheduling Problem Based on a New Mathematical Formulation

Management Science
An experimental study of LP-based approximation algorithms for scheduling problems

Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
On Implementing Push-Relabel Method for the Maximum Flow Problem

Proceedings of the 4th International IPCO Conference on Integer Programming and Combinatorial Optimization
Algorithmic Graph Theory and Perfect Graphs (Annals of Discrete Mathematics, Vol 57)

Algorithmic Graph Theory and Perfect Graphs (Annals of Discrete Mathematics, Vol 57)

Scheduling and constraint propagation

Discrete Applied Mathematics
Solving Project Scheduling Problems by Minimum Cut Computations

Management Science
On project scheduling with irregular starting time costs

Operations Research Letters

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.