The project scheduling problem with production and consumption of resources: A list-scheduling based algorithm

Authors:
Jacques Carlier;Aziz Moukrim;Huang Xu
Affiliations:
Laboratoire HEUDIASYC UMR CNRS 6599, Universitè de Technologie de Compiègne, BP 20529, 60205 Compiègne cedex, France;Laboratoire HEUDIASYC UMR CNRS 6599, Universitè de Technologie de Compiègne, BP 20529, 60205 Compiègne cedex, France;Laboratoire HEUDIASYC UMR CNRS 6599, Universitè de Technologie de Compiègne, BP 20529, 60205 Compiègne cedex, France
Venue:
Discrete Applied Mathematics
Year:
2009

Citing 5
Cited 0

Scheduling project networks with resource constraints and time windows

Annals of Operations Research
Network flows

Optimization
A Constraint-Based Method for Project Scheduling with Time Windows

Journal of Heuristics
Algorithms for propagating resource constraints in AI planning and scheduling: existing approaches and new results

Artificial Intelligence
On the complexity of scheduling unit-time jobs with OR-precedence constraints

Operations Research Letters

Quantified Score

Hi-index	0.04

Visualization

Abstract

The paper deals with algorithms for applying classical list scheduling to a project scheduling problem where the units of resources are produced or consumed at the occurrence of precedence-related events. It is shown that the feasibility variant of the project scheduling problem is NP-complete. Moreover, polynomial-time scheduling algorithms are devised for the three cases where the occurrence time sequence of all events or the consuming events or the producing events is given in advance. By enumerating these sequences (called linear orders), one obtains a list-scheduling based algorithm for minimizing the makespan of a project scheduling problem with production and consumption of resources.