Storage Resources

This chapter looks at project scheduling problems with storage resources. Activities can produce or consume resources at their start or at their completion. We consider projects composed of events subject to precedence constraints and resource constraints. We describe briefly the exact methods of Ne...

Full description

Saved in:
Bibliographic Details
Published inHandbook on Project Management and Scheduling Vol. 1; pp. 177 - 189
Main Authors Carlier, Jacques, Moukrim, Aziz
Format Book Chapter
LanguageEnglish
Published Cham Springer International Publishing 2015
SeriesInternational Handbooks on Information Systems
Subjects
Computer Science
Linear order
Makespan minimization
Operations Research
Project scheduling
Storage resources
Project scheduling
Makespan minimization
Storage resources
Linear order
Online AccessGet full text
ISBN9783319054421
3319054422
DOI10.1007/978-3-319-05443-8_9

Cover

More Information
Summary:This chapter looks at project scheduling problems with storage resources. Activities can produce or consume resources at their start or at their completion. We consider projects composed of events subject to precedence constraints and resource constraints. We describe briefly the exact methods of Neumann and Schwindt and of Laborie, which solve the problem when stocks of resources have to be between minimum and maximum levels. We then suppose that there are no maximum stocks. We report the shifting algorithm which solves in polynomial time the financing problem where resources are produced at given dates. We also explain how an earliest schedule corresponding to a linear order of consumption events can be built. The enumeration of linear orders then becomes sufficient for building an exact method.
ISBN:9783319054421
3319054422
DOI:10.1007/978-3-319-05443-8_9