Storage Resources

Jacques Carlier () and Aziz Moukrim ()
Additional contact information
Jacques Carlier: Université de Technologie de Compiègne
Aziz Moukrim: Université de Technologie de Compiègne

Chapter Chapter 9 in Handbook on Project Management and Scheduling Vol.1, 2015, pp 177-189 from Springer

Abstract: Abstract 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.

Keywords: Linear order; Makespan minimization; Project scheduling; Storage resources (search for similar items in EconPapers)
Date: 2015
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:ihichp:978-3-319-05443-8_9

Ordering information: This item can be ordered from
http://www.springer.com/9783319054438

DOI: 10.1007/978-3-319-05443-8_9

Access Statistics for this chapter

More chapters in International Handbooks on Information Systems from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().