Please use this identifier to cite or link to this item:
Title: An integer programming approach to the multimode resource-constrained multiproject scheduling problem.
Authors: Toffolo, Túlio Ângelo Machado
Santos, Haroldo Gambini
Carvalho, Marco Antonio Moreira de
Araujo, Janniele Aparecida Soares
Keywords: Multimode resource-constrained multiproject scheduling problem
Integer programming
Issue Date: 2015
Citation: TOFFOLO, T. A. M. et al. An integer programming approach to the multimode resource-constrained multiproject scheduling problem. Journal of Scheduling, v. 19, p. 295–307, 2015. Disponível em: <>. Acesso em: 28 jul. 2017.
Abstract: The project scheduling problem (PSP) is the subject of several studies in computer science, mathematics, and operations research because of the hardness of solving it and its practical importance. This work tackles an extended version of the problem known as the multimode resourceconstrained multiproject scheduling problem. A solution to this problem consists of a schedule of jobs from various projects, so that the job allocations do not exceed the stipulated limits of renewable and nonrenewable resources. To accomplish this, a set of execution modes for the jobs must be chosen, as the jobs’ duration and amount of needed resources vary depending on the mode selected. Finally, the schedule must also consider precedence constraints between jobs. This work proposes heuristic methods based on integer programming to solve the PSP considered in the Multidisciplinary International Scheduling Conference: Theory and Applications (MISTA) 2013 Challenge. The developed solver was ranked third in the competition, being able to find feasible and competitive solutions for all instances and improving best known solutions for some problems.
ISSN: 10991425
Appears in Collections:DECSI - Artigos publicados em periódicos

Files in This Item:
File Description SizeFormat 
ARTIGO_IntergerProgrammingAproach.pdf590,07 kBAdobe PDFView/Open    Request a copy

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.