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

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.