An integer programming approach to the multimode resource-constrained multiproject scheduling problem

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 resource-constrained multip...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Journal of scheduling Ročník 19; číslo 3; s. 295 - 307
Hlavní autoři: Toffolo, Túlio A. M., Santos, Haroldo G., Carvalho, Marco A. M., Soares, Janniele A.
Médium: Journal Article
Jazyk:angličtina
Vydáno: New York Springer US 01.06.2016
Springer Nature B.V
Témata:
Allocations
Artificial Intelligence
Business and Management
Calculus of Variations and Optimal Control; Optimization
Civil engineering
Computer science
Conferences
Critical path
Employment
Heuristic
Integer programming
Job shops
Linear programming
Mathematical analysis
Mathematical models
Operations research
Operations Research/Decision Theory
Optimization
Optimization techniques
Project management
Resource scheduling
Schedules
Scheduling
Software engineering
Software upgrading
Solvers
Studies
Supply Chain Management
Variables
Integer programming
MISTA Challenge
Multimode resource-constrained multiproject scheduling problem
Matheuristics
ISSN:1094-6136, 1099-1425
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí: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 resource-constrained 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.
Bibliografie:SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ObjectType-Article-1
ObjectType-Feature-2
content type line 23
ISSN:1094-6136
1099-1425
DOI:10.1007/s10951-015-0422-4