Download PDF

Journal of Scheduling

Publication date: 2015-01-01
Volume: 18 Pages: 61 - 74
Publisher: J. Wiley

Author:

Wauters, Tony
Verbeeck, Katja ; De Causmaecker, Patrick ; Vanden Berghe, Greet

Keywords:

Multi-project scheduling, Learning Automata, Dispersion games, Science & Technology, Technology, Engineering, Manufacturing, Operations Research & Management Science, Engineering, Learning automata, SYSTEM, MODEL, 0102 Applied Mathematics, 0103 Numerical and Computational Mathematics, 1503 Business and Management, Operations Research, 3507 Strategy, management and organisational behaviour, 4901 Applied mathematics

Abstract:

© 2014, Springer Science+Business Media New York. 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.