The Basic Multi-Project Scheduling Problem
In this chapter the Basic Multi-Project Scheduling Problem (BMPSP) is described, an overview of the literature on multi-project scheduling is provided, and a solution approach based on a biased random-key genetic algorithm (BRKGA) is presented. The BMPSP consists in finding a schedule for all the activities belonging to all the projects taking into account the precedence constraints and the availability of resources, while minimizing some measure of performance. The representation of the problem is based on random keys. The BRKGA generates priorities, delay times, and release dates, which are used by a heuristic decoder procedure to construct parameterized active schedules. The performance of the proposed approach is validated on a set of randomly generated problems.
KeywordsGenetic algorithm Meta-heuristics Multi-project scheduling Random keys
This work has been partially supported by funds granted by the ERDF through the Programme COMPETE and by the Portuguese Government through FCT, the Foundation for Science and Technology, project PTDC/EGE-GES/117692/2010.
- Ash R (1999) Activity scheduling in the dynamic, multi-project setting: choosing heuristics through deterministic simulation. In: Proceedings of the 1999 winter simulation conference, Phoenix, pp 937–941Google Scholar
- Baker KR (1974) Introduction to sequencing and scheduling. Wiley, New YorkGoogle Scholar
- Cai Z, Li X (2012) A hybrid genetic algorithm for resource-constrained multi-project scheduling problem with resource transfer time. In: Proceedings of the 2012 IEEE international conference on automation science and engineering (CASE 2012), Seoul, pp 569–574Google Scholar
- Fendley L (1968) Towards the development of a complete multiproject scheduling system. J Ind Eng 19(10):505–515Google Scholar
- Gonçalves JF, Beirão NC (1999) Um algoritmo genético baseado em chaves aleatórias para sequenciamento de operações. Revista da Associação Portuguesa de Investigação Operacional 19:123–137 (in Portuguese)Google Scholar
- Kumanam S, Raja K (2011) Multi-project scheduling using a heuristic and memetic alogrithm. J Manuf Sci Prod 10(3–4):249–256Google Scholar
- Lova A, Tormos P (2002) Combining random sampling and backward-forward heuristics for resource-constrained multi-project scheduling. In: Proceedings of the eight international workshop on project management and scheduling, Valencia, pp 244–248Google Scholar
- Mendes J (2003) Sistema de apoio à decisão para planeamento de sistemas de produção do tipo projecto. Ph.D. dissertation, Universidade do Porto, Porto (in Portuguese)Google Scholar
- Shankar V, Nagi R (1996) A flexible optimization approach to multi-resource, multi-project planning and scheduling. In: Proceedings of 5th industrial engineering research conference, Minneapolis, pp 263–267Google Scholar
- Spears WM, Dejong KA (1991) On the virtues of parameterized uniform crossover. In: Proceedings of the fourth international conference on genetic algorithms, San Diego, pp 230–236Google Scholar