.png){kind=icon}
返回
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}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
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.
Keyword:
Project scheduling
Integer programming formulations
Time/cost trade-offs
Irregular costs
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
C
IF:
4.3
论文数:
6.5K
被引数:
1.8W
机构
引用论文
.png){kind=icon}
分享收藏分享收藏
查看更多内容