.png){kind=icon}
.png){kind=icon}
Return
An integer programming formulation for the project scheduling problem with irregular time-cost tradeoffs
.png){kind=icon}
PRE
AI
DOI：10.1016/j.cor.2011.08.011.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Four integer programming formulations are studied for the irregular costs project scheduling problem with time/cost trade-offs (PSIC). Three formulations using standard assignment type variables are tested against a more novel integer programming formulation. Empirical tests show that in many instances the new formulation performs best and can solve problems with up to 90 activities in a reasonable amount of time. This is explained by a reduced number of binary variables, a tighter linear programming (LP) relaxation, and the sparsity and embedded network structure of the constraint matrix of the new formulation. (C) 2011 Elsevier Ltd. All rights reserved.
Keywords:
Project scheduling
Integer programming formulations
Time/cost trade-offs
Irregular costs
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
C
IF:
4.3
Papers:
6.5K
Citations:
1.8W