Solving Project Scheduling Problems by Minimum Cut Computations

• Published in: Management science Vol. 49; no. 3; pp. 330 - 350
• Main Authors: Mohring, Rolf H, Schulz, Andreas S, Stork, Frederik, Uetz, Marc
• Format: Journal Article
• Language: English
• Published: Linthicum INFORMS 01.03.2003; Institute for Operations Research and Management Sciences; Institute for Operations Research and the Management Sciences
• Series: Management Science
• Subjects: Algorithms; Approximation; Business studies; Costs; Employment; Heuristics; Industrial projects; Integer programming; Integers; Job shops; Lagrangian function; Lagrangian Relaxation; Linear programming; Linear Programming Relaxation; Management; Mathematical programming; Mathematics; Minimization of cost; Minimum Cut; Net present value; Operations research; Optimal solutions; Optimization techniques; Planning methods; Production; Production planning; Project management; Project Scheduling; Renewable resources; Resource Constraints; Scheduling; Studies; Tabu search

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 manufactur...