An integer programming approach to the multimode resource-constrained multiproject scheduling problem.
Nenhuma Miniatura disponível
Data
2015
Título da Revista
ISSN da Revista
Título de Volume
Editor
Resumo
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.
Descrição
Palavras-chave
Multimode resource-constrained multiproject scheduling problem, Integer programming, Matheuristics
Citação
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: <https://link.springer.com/article/10.1007/s10951-015-0422-4>. Acesso em: 28 jul. 2017.