Comparison of mixed integer linear programming models for the resource-constrained project scheduling problem with consumption and production of resources
- 851 Downloads
This paper addresses an extension of the resource-constrained project scheduling problem that takes into account storage resources which may be produced or consumed by activities. To solve this problem, we propose the generalization of two existing mixed integer linear programming models for the classical resource-constrained project scheduling problem, as well as one novel formulation based on the concept of event. Computational results are reported to compare these formulations with each other, as well as with a reference method from the literature. Conclusions are drawn on the merits and drawbacks of each model according to the instance characteristics.
KeywordsResource-constrained project scheduling Mixed integer linear programming Consumption and production of resources Event-based on/off formulation
This project was partially funded by the CNRS Energy Interdisciplinary Program (PIE), GIMEP project 2008–2010, and partially supported by French National Research Agency (ANR) through COSINUS program (project ID4CS no ANR-09-COSI-005). The authors are grateful to Philippe Laborie who kindly provided his code for our computational comparisons and to Emmanuel Hébrard for help in conducting some experiments. We also wish to thank the anonymous referees for their numerous constructive remarks. This research was initiated while the first author was with CIRRELT, Université de Montréal, Canada.
- Artigues C, Koné O, Lopez P, Mongeau M, Néron E, Rivreau D (2008) Computational experiments. In: Artigues C, Demassey S, Néron E (eds) Resource-constrained project scheduling: Models, algorithms, extensions and applications, ISTE/Wiley, pp 98–102Google Scholar
- Balas E (1970) Project scheduling with resource constraints. In: Beale EML (ed) Applications of mathematical programming techniques. American Elsevier, Amsterdam, pp 187–200Google Scholar
- Bouly H, Carlier J, Moukrim A, Russo M (2005) Solving RCPSP with resources production possibility by tasks. In: MHOSI’2005, 24–26 AprilGoogle Scholar
- Dauzère-Pérès S, Lasserre JB (1995) A new mixed-integer formulation of the flow-shop sequencing problem. In: 2nd Workshop on models and algorithms for planning and scheduling problems, Wernigerode, GermanyGoogle Scholar
- High-duration RCPSP instances with consumption and production of resources. http://www.laas.fr/files/MOGISA/RCPSP-instances/high_duration_range_with_production.zip
- Kolisch R, Sprecher A (1997) PSPLIB—a project scheduling problem library. Eur J Oper Res 96(1):205–216Google Scholar
- Lasserre JB, Queyranne M (1992) Generic scheduling polyhedra and a new mixed-integer formulation for single-machine scheduling. In: Proceedings of the 2nd integer programming and combinatorial optimization conference, IPCO, pp 136–149Google Scholar
- Pfund ME, Mason SJ, Fowler JW (2006) Semiconductor manufacturing scheduling and dispatching. State of the art and survey of needs. In: Handbook of Production Scheduling. International Series in Operations Research & Management Science. Springer, Berlin, vol 89, pp 213–241Google Scholar
- PSPLIB. http://220.127.116.11/psplib/
- Uetz M (2001) Algorithms for deterministic and stochastic scheduling, PhD thesis, Technische Universität Berlin, 2001Google Scholar