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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Abdel-Wahab HM, Kameda T (1978) Scheduling to minimize maximum cumulative costs subject to series-parallel precedence constraints. Oper Res 26:141–158
Błażewicz, cf. Chap. 1: Błażewicz J, Cellary W, Słowiński R, Wȩglarz J (1986) Scheduling under resource constraints: deterministic models. Baltzer, Basel
Briskorn D, Jaehn F, Pesch E (2013) Exact algorithms for inventory constrained scheduling on a single machine. J Sched 16:105–115
Carlier J (1984) Problèmes d’ordonnancements à contraintes de ressources: algorithmes et complexité. Habilitation thesis, Université de Paris VI, France
Carlier J (1989) Scheduling under financial constraints. In: Słowiński R, Wȩglarz J (eds) Advances in project scheduling. Elsevier, Amsterdam, pp 187–224
Carlier J, Rinnooy Kan AHG (1982) Financing and scheduling. Oper Res Lett 1:52–55
Carlier J, Moukrim A, Xu H (2009) The project scheduling problem with production and consumption of resources: a list-scheduling based algorithm. Discrete Appl Math 157:3631–3642
Carlier J, Moukrim A, Xu H (2010) A branch and bound method for the generalized resource constrained project scheduling problem. In: Proceedings of the 10th international workshop on project management and scheduling, Poznań, pp 135–140
Drotos M, Kis T (2013) Scheduling of inventory releasing jobs to minimize a regular objective function of delivery times. J Scheduling 16:337–346
Graham R, Lawler EL, Lenstra JK, Rinnooy Kan AHG (1979) Optimization and approximation in deterministic sequencing and scheduling: a survey. Ann Discrete Math 5:287–326
Koné O, Artigues C, Lopez P, Mongeau M (2013) Comparison of mixed integer linear programming models for the resource constrained project scheduling problem with consumption and production of resources. Flex Serv Manuf J 25:25–47
Laborie P (2003) Algorithms for propagating resource constraints in AI planning and scheduling: existing approaches and new results. Artif Intell 143:151–188
Le Pape C (1994) Implementation of resource constraints in ILOG Schedule: a library for the development of constraint-based scheduling systems. Intell Syst Eng 3:55–66
Neumann K, Schwindt C (2003) Project scheduling with inventory constraints. Math Method Oper Res 56:513–533
Neumann K, Schwindt C, Zimmermann J (2003) Project scheduling with time windows and scarce resources: temporal and resource-constrained project scheduling with regular and nonregular objective functions. Springer, Berlin
Sethi R (1975) Complete register allocation. SIAM J Comput 4:226–248
Słowiński R (1984) Preemptive scheduling of independent jobs on parallel machines subject to financial constraints. Eur J Oper Res 15:366–373
Acknowledgements
This work was carried out within the framework of the Labex MS2T, which was funded by the French Government, through the program Investments for the future managed by the National Agency for Research (Reference ANR-11-IDEX-0004-02).
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer International Publishing Switzerland
About this chapter
Cite this chapter
Carlier, J., Moukrim, A. (2015). Storage Resources. In: Schwindt, C., Zimmermann, J. (eds) Handbook on Project Management and Scheduling Vol.1. International Handbooks on Information Systems. Springer, Cham. https://doi.org/10.1007/978-3-319-05443-8_9
Download citation
DOI: https://doi.org/10.1007/978-3-319-05443-8_9
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-05442-1
Online ISBN: 978-3-319-05443-8
eBook Packages: Business and EconomicsBusiness and Management (R0)