The basic multi-project scheduling problem

• Type: Chapter or Part of a Book
• Date: 2015

Authors

Jose Fernando Goncalves (Author) FEP; De Mendes, JJM (Author) Other; Resende, MGC (Author) Other

Book

Title: Handbook on Project Management and Scheduling Vol. 2

Pages: 667-683

ISBN: 9783319059150; 9783319059143

Electronic ISBN: 978-3-319-05915-0

Indexing

Scopus - 6 Citations

Other information

Authenticus ID: P-00G-SNA

DOI: 10.1007/978-3-319-05915-0_1

Abstract (EN): 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.

Language: English

Type (Professor's evaluation): Scientific