← Search

Management Science Vol. 49 No. 3 2003

Solving Project Scheduling Problems by Minimum Cut Computations

Rolf H. Möhring1; Andreas S. Schulz2; Frederik Stork3; Marc Uetz4

1 Fakultät II, Institut für Mathematik, Technische Universität Berlin, Sekr. MA 6-1, Straβe des 17. Juni 136, D-10623 Berlin, Germany · 2 Sloan School of Management, E53-361, Massachusetts Institute of Technology, 77 Massachusetts Avenue, Cambridge, Massachusetts 02139 · 3 ILOG Deutschland GmbH, Ober-Eschbacher Straβe 109, D-61352 Bad Homburg, Germany · 4 Faculty of Economics and Business Administration, Quantitative Economics, Universiteit Maastricht, P.O. Box 616, 6200 MD Maastricht, The Netherlands

open access

Abstract

In project scheduling, a set of precedence-constrained jobs has to be scheduled so as to minimize a given objective. In resource-constrained project scheduling, the jobs additionally compete for scarce resources. Due to its universality, the latter problem has a variety of applications in manufacturing, production planning, project management, and elsewhere. It is one of the most intractable problems in operations research, and has therefore become a popular playground for the latest optimization techniques, including virtually all local search paradigms. We show that a somewhat more classical mathematical programming approach leads to both competitive feasible solutions and strong lower bounds, within reasonable computation times. The basic ingredients of our approach are the Lagrangian relaxation of a time-indexed integer programming formulation and relaxation-based list scheduling, enriched with a useful idea from recent approximation algorithms for machine scheduling problems. The efficiency of the algorithm results from the insight that the relaxed problem can be solved by computing a minimum cut in an appropriately defined directed graph. Our computational study covers different types of resource-constrained project scheduling problems, based on several notoriously hard test sets, including practical problem instances from chemical production planning.

DOI
10.1287/mnsc.49.3.330.12737
Volume
49
Issue
3
Pages
330-350
Language
en
Sources
bibtex:phds-export.bib openalex crossref

Cite