Premium
The multimode resource constrained multiproject scheduling problem: Alternative formulations
Author(s) -
Zapata Juan Camilo,
Hodge Bri Mathias,
Reklaitis Gintaras V.
Publication year - 2008
Publication title -
aiche journal
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.958
H-Index - 167
eISSN - 1547-5905
pISSN - 0001-1541
DOI - 10.1002/aic.11522
Subject(s) - curse of dimensionality , mathematical optimization , computer science , scheduling (production processes) , search engine indexing , range (aeronautics) , mode (computer interface) , operations research , mathematics , engineering , artificial intelligence , aerospace engineering , operating system
Tactical management of development pipelines is concerned with the allocation of resources and scheduling of tasks. Though these decisions have to be made in the presence of uncertainty, to make the problem solvable it is customary to use deterministic MILP formulations of the multi‐mode RCMPSP that are reevaluated after important uncertainties are realized. In spite of the major simplifications attained by down‐ playing the stochastic nature of the problem, the curse of dimensionality limits the exact solution of the formulations to very small systems. The curse is mainly caused by 3 factors: the indexing of the task execution modes the indexing of time periods, and the discrete character of the resources. Three models that attempt to overcome these limitations are proposed and compared. Results show that despite the theoretical advantages of the strategies used, the alternative formulations are limited to problems in the same range of applicability of the conventional multi‐mode formulation. © 2008 American Institute of Chemical Engineers AIChE J, 2008