On project scheduling with irregular starting time costs

Authors:
Rolf H. MöHring;Andreas S. Schulz;Frederik Stork;Marc Uetz
Affiliations:
Technische Universität Berlin, Institut für Mathematik, Sekr. MA 6-1, Straíe des 17. Juni 136, D-10623 Berlin, Germany;MIT, Sloan School of Management, E53-361, 77 Massachusetts Av., Cambridge, MA 02139, USA;Technische Universität Berlin, Institut für Mathematik, Sekr. MA 6-1, Straíe des 17. Juni 136, D-10623 Berlin, Germany;Technische Universität Berlin, Institut für Mathematik, Sekr. MA 6-1, Straíe des 17. Juni 136, D-10623 Berlin, Germany
Venue:
Operations Research Letters
Year:
2001

Citing 8
Cited 4

Scheduling tasks with due dates in a fabrication/assembly process

Operations Research
A new approach to the maximum-flow problem

Journal of the ACM (JACM)
Analyzing and exploiting the structure of the constraints in the ILP approach to the scheduling problem

IEEE Transactions on Very Large Scale Integration (VLSI) Systems - Special issue on low-power design
Polynomial Methods for Separable Convex Optimization in Unimodular Linear Spaces with Applications

SIAM Journal on Computing
Beyond the flow decomposition barrier

Journal of the ACM (JACM)
Solving the Convex Cost Integer Dual Network Flow Problem

Proceedings of the 7th International IPCO Conference on Integer Programming and Combinatorial Optimization
Resource-Constrained Project Scheduling: Computing Lower Bounds by Solving Minimum Cut Problems

ESA '99 Proceedings of the 7th Annual European Symposium on Algorithms
The project scheduling problem with irregular starting time costs

Operations Research Letters

Solving Project Scheduling Problems by Minimum Cut Computations

Management Science
An integer programming formulation for the project scheduling problem with irregular time-cost tradeoffs

Computers and Operations Research
Scheduling an r&d project with quality-dependent time slots

ICCSA'06 Proceedings of the 2006 international conference on Computational Science and Its Applications - Volume Part III
An efficient hybrid search algorithm for various optimization problems

EvoCOP'06 Proceedings of the 6th European conference on Evolutionary Computation in Combinatorial Optimization

Quantified Score

Hi-index	0.00

Visualization

Abstract

Maniezzo and Mingozzi (Oper. Res. Lett. 25 (1999) 175-182) study a project scheduling problem with irregular starting time costs. Starting from the assumption that its computational complexity status is open, they develop a branch-and-bound procedure and they identify special cases that are solvable in polynomial time. In this note, we present a collection of previously established results which show that the general problem is solvable in polynomial time. This collection may serve as a useful guide to the literature, since this polynomial-time solvability has been rediscovered in different contexts or using different methods. In addition, we briefly review some related results for specializations and generalizations of the problem.