The basic multi-project scheduling problem

Thumbnail Image
Date
2015
Authors
José Fernando Gonçalves
De Mendes,JJM
Resende,MGC
Journal Title
Journal ISSN
Volume Title
Publisher
Abstract
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. © Springer International Publishing Switzerland 2015.
Description
Keywords
Citation