Abstract
The present paper introduces a learning-based optimization approach to the resource-constrained multi-project scheduling problem. Multiple projects, each with their own set of activities, need to be scheduled. The objectives dealt with here include minimization of the average project delay and total makespan. The availability of local and global resources, precedence relations between activities, and non-equal project start times have to be considered. The proposed approach relies on a simple sequence learning game played by a group of project managers. The project managers each learn their activity list locally using reinforcement learning, more specifically learning automata. Meanwhile, they learn how to choose a suitable place in the overall sequence of all activity lists. All the projects need to arrive at a unique place in this sequence. A mediator, who usually has to solve a complex optimization problem, now manages a simple dispersion game. Through the mediator, a sequence of feasible activity lists is eventually scheduled by using a serial schedule generation scheme, which is adopted from single project scheduling. It is shown that the sequence learning approach has a large positive effect on minimizing the average project delay. In fact, the combination of local reinforcement learning, the sequence learning game and a forward-backward implementation of the serial scheduler significantly improves the best known results for all the MPSPLIB datasets. In addition, several new best results were obtained for both considered objectives: minimizing the average project delay and minimizing the total makespan.
Similar content being viewed by others
Notes
MPSPLIB, http://www.mpsplib.com, January 21, 2014.
also known as roulette wheel selection.
The logarithmic behaviour for the uniform BSS was already shown by Grenager et al. (2002).
MPSPLib, http://www.mpsplib.com, January 21, 2014.
PSPLib, http://www.om-db.wi.tum.de/psplib/main.html. January 21, 2014.
References
Adhau, S., Mittal, M. L., & Mittal, A. (2012). A multi-agent system for distributed multi-project scheduling: An auction-based negotiation approach. Engineering Applications of Artificial Intelligence, 25(8), 1738–1751.
Browning, T. R., & Yassine, A. A. (2010). Resource-constrained multi-project scheduling: Priority rule performance revisited. International Journal of Production Economics, 126(2), 212–228.
Brucker, P., Drexl, A., Möhring, R., Neumann, K., & Pesch, E. (1999). Resource-constrained project scheduling: Notation, classification, models, and methods. European Journal of Operational Research, 112, 3–41.
Chen, V. Y. X. (1994). A 0–1 programming model for scheduling multiple maintenance project at a copper mine. EJOR, 76(1), 176–191.
Confessore, G., Giordani, S., & Rismondo, S. (2007). A market-based multi-agent system model for decentralized multi-project scheduling. Annals of Operational Research, 150, 115–135.
Deckro, R. F., Winkofsky, E. P., Hebert, J. E., & Gagnon, R. (1991). A decomposition approach to multi-project scheduling. European Journal of Operational Research, 51(1), 110–118.
Goncalves, J. F., Mendes, J. J. M., & Resende, M. G. C. (2008). A genetic algorithm for the resource constrained multi-project scheduling problem. European Journal of Operational Research, 189(3), 1171–1190.
Grenager, T., Powers, R., & Shoham, Y. (2002). Dispersion games: General definitions and some specific learning results. AAAI (pp. 398–403). Menlo Park: AAAI Press.
Homberger, J. (2007). A multi-agent system for the decentralized resource-constrained multi-project scheduling problem. International Transactions in Operational Research, 14, 565–589.
Homberger, J. (2012). A (\(\mu, \lambda \))-coordination mechanism for agent-based multi-project scheduling. OR Spectrum, 34(1), 107–132.
Kolisch, R., & Hartmann, S. (1999). Heuristic algorithms for the resource-constrained project scheduling problem: Classification and computational analysis. In Jan Weglarz (Ed.), Project scheduling (Vol. 14, pp. 147–178)., International series in operations research & management science New York, USA: Springer.
Kumanam, S., & Raja, K. (2011). Multi-project scheduling using a heuristic and memetic algorithm. Journal for Manufacturing Science and Production, 10(3–4), 249256.
Kurtulus, I., & Davis, E. W. (1982). Multi-project scheduling: Categorization of heuristic rules performance. Management Science, 28(2), 161–172.
Li, K. Y., & Willis, R. J. (1992). An iterative scheduling technique for resource-constrained project scheduling. European Journal of Operational Research, 56, 370–379.
Littman, M.L. (1994). Markov games as a framework for multi-agent reinforcement learning. In Proceedings of the eleventh international conference on machine learning (pp. 157–163). New Brunswick: Morgan Kaufmann.
Lova, A., & Tormos, P. (2001). Analysis of scheduling schemes and heuristic rules performance in resource-constrained multiproject scheduling. Annals of Operations Research, 102(1–4), 263–286.
Lova, A., Maroto, C., & Tormos, P. (2000). A multicriteria heuristic method to improve resource allocation in multiproject scheduling. European Journal of Operational Research, 127, 408–424.
Pritsker, A. A. B., Watters, L. J., & Wolfe, P. M. (1969). Multiproject scheduling with limited resources: A zero-one programming approach. Management Science, 16(1), 93–108.
Thathachar, M. A. L., & Sastry, P. S. (2004). Networks of learning automata: Techniques for online stochastic optimization. Boston: Kluwer Academic Publishers.
Valls, V., Ballestin, F., & Quintanilla, S. (2005). Justification and RCPSP: A technique that pays. European Journal of Operational Research, 165(2), 375–386.
Vercellis, C. (1994). Constrained multi-project plannings problems: A lagrangean decomposition approach. European Journal of Operational Research, 78(2), 267–275.
Wauters, T., Verbeeck, K., Vanden Berghe, G., & De Causmaecker, P. (2009, May). A multi-agent learning approach for the multi-mode resource-constrained project scheduling problem. In Optimisation in multi-agent systems workshop at the conference on autonomous and multi-agent systems (AAMAS 2009), Budapest, Hungary.
Wauters, T., Verbeeck, K., De Causmaecker, P., & Vanden Berghe, G. (2010, May). A game theoretic approach to decentralized multi-project scheduling (extended abstract). In: van der Hoek, Kaminka, Lesprance, Luck, & Sen, (Eds.), Proceedings of 9th international conference on autonomous agents and multiagent systems (AAMAS 2010), number R-24, (pp. 1415–1416), Toronto, Canada.
Wauters, T., Verbeeck, K., Vanden Berghe, G., & De Causmaecker, P. (2011). Learning agents for the multi-mode project scheduling problem. Journal of Operational Research Society: Special Issue on Heuristic Optimization, 62, 281–290.
Wauters, T., Verbeeck, K., Causmaecker, P., & Vanden Berghe, G. (2012). Fast permutation learning. In Youssef Hamadi & Marc Schoenauer (Eds.), Learning and intelligent optimization (pp. 292–306)., Lecture notes in computer science Berlin Heidelberg: Springer.
Willis, R. J. (1985). Critical path analysis and resource constrained project scheduling theory and practice. European Journal of Operational Research, 21(2), 149–155.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Wauters, T., Verbeeck, K., De Causmaecker, P. et al. A learning-based optimization approach to multi-project scheduling. J Sched 18, 61–74 (2015). https://doi.org/10.1007/s10951-014-0401-1
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10951-014-0401-1