An integer programming approach to the multimode resource-constrained multiproject scheduling problem.
No Thumbnail Available
Date
2016
Journal Title
Journal ISSN
Volume Title
Publisher
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.
Description
Keywords
Matheuristics, Multidisciplinary International Scheduling Conference: Theory and Applications - MISTA - 2013 Challenge
Citation
TOFFOLO, T. A. M. et al. An integer programming approach to the multimode resource-constrained multiproject scheduling problem. Journal of Scheduling, v. 19, n. 5, p. 295-307, 2016. Disponível em: <http://download.springer.com/static/pdf/549/art%253A10.1007%252Fs10951-015-0422-4.pdf?originUrl=http%3A%2F%2Flink.springer.com%2Farticle%2F10.1007%2Fs10951-015-0422-4&token2=exp=1484912014~acl=%2Fstatic%2Fpdf%2F549%2Fart%25253A10.1007%25252Fs10951-015-0422-4.pdf%3ForiginUrl%3Dhttp%253A%252F%252Flink.springer.com%252Farticle%252F10.1007%252Fs10951-015-0422-4*~hmac=6af17dc04a689c25c355b7d8e2f8bb745ff2050e1ae15aae5f2704fa34286a23>. Acesso em: 20 jan. 2017.