An integer programming formulation for the project scheduling problem with irregular time-cost tradeoffs

被引：20

作者：

Szmerekovsky, Joseph G. ^{[1
]}

Venkateshan, Prahalad ^{[2
]}

机构：

[1] N Dakota State Univ, Coll Business, NDSU Dept 2420, Fargo, ND 58108 USA

[2] Indian Inst Management, Ahmadabad 380015, Gujarat, India

来源：

COMPUTERS & OPERATIONS RESEARCH | 2012年 / 39卷 / 07期

关键词：

Project scheduling; Integer programming formulations; Time/cost trade-offs; Irregular costs; DISCOUNTED CASH FLOWS; MODELS; IMPACT;

D O I：

10.1016/j.cor.2011.08.011

中图分类号：

TP39 [计算机的应用];

学科分类号：

081203 ; 0835 ;

摘要：

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.

引用

页码：1402 / 1410

页数：9

共 33 条

[11] Scheduling project activities to maximize the net present value - the case of linear time-dependent cash flows [J].

Etgar, R ;

Shtub, A .

INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 1999, 37 (02) :329-339

[12]

Goldratt E.M., 1997, CRITICAL CHAIN

[13] Project scheduling with irregular costs: complexity, approximability, and algorithms [J].

Grigoriev, A ;

Woeginger, G .

ACTA INFORMATICA, 2004, 41 (2-3) :83-97

[14]

Haga W.A., 2004, PROJ MANAG J, V35, P31

[15] Project network models with discounted cash flows a guided tour through recent developments [J].

Herroelen, WS ;

VanDommelen, P ;

Demeulemeester, EL .

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1997, 100 (01) :97-121

[16] Selection, provisioning, shared fixed costs, maximum closure, and implications on algorithmic methods today [J].

Hochbaum, DS .

MANAGEMENT SCIENCE, 2004, 50 (06) :709-723

[17]

Icmeli O., 1996, Journal of Operations Management, V14, P255, DOI 10.1016/0272-6963(95)00025-9

[18]

Icmeli O, 1993, J OPERATIONS PRODUCT, V13, P80

[19]

ILOG IBM, 2011, CPLEX 12 2 US MAN

[20] PSPLIB - A project scheduling problem library [J].

Kolisch, R ;

Sprecher, A .

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1997, 96 (01) :205-216

← 1 2 3 4 →