Optimal start times under stochastic activity durations

被引:19
作者
Elmaghraby, SE [1 ]
Ferreira, AA [1 ]
Tavares, LV [1 ]
机构
[1] N Carolina State Univ, Raleigh, NC 27695 USA
关键词
activity networks; scheduling; start times;
D O I
10.1016/S0925-5273(99)00054-7
中图分类号
T [工业技术];
学科分类号
08 ;
摘要
We treat the problem of sequencing n activities on a single facility with the objective of determining their start times to maximize an economic gain, subject to restrictions on their availabilities. The activities possess random durations. We present a dynamic programming model that determines the optimal value and yields the desired start times, which also imply the optimal sequence. An approximation is also offered to lighten the computing burden somewhat. (C) 2000 Elsevier Science B.V. All rights reserved.
引用
收藏
页码:153 / 164
页数:12
相关论文
共 17 条
[1]  
BROWN RG, 1967, DECISION RULES INVEN, P95
[2]   Activity delay in stochastic project networks [J].
Buss, AH ;
Rosenblatt, MJ .
OPERATIONS RESEARCH, 1997, 45 (01) :126-139
[3]  
DU J, 1992, J COMBIN MATH COMBIN, V11, P97
[4]   MINIMIZING TOTAL TARDINESS ON ONE MACHINE IS NP-HARD [J].
DU, JZ ;
LEUNG, JYT .
MATHEMATICS OF OPERATIONS RESEARCH, 1990, 15 (03) :483-495
[5]   THE SCHEDULING OF ACTIVITIES TO MAXIMIZE THE NET PRESENT VALUE OF PROJECTS [J].
ELMAGHRABY, SE ;
HERROELEN, WS .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1990, 49 (01) :35-49
[6]  
ELMAGHRABY SE, 1998, OPTIMAL ACTIVITY STA
[7]  
ELMAGHRABY SE, 1997, OPTIMAL RELEASE TIME
[8]  
Fernandez A.A., 1995, THESIS U CENTRAL FLO
[9]  
Garey M. S., 1979, COMPUTERS INTRACTIBI
[10]   Ready-time scheduling with stochastic service times [J].
Hodgson, TJ ;
King, RE ;
Stanfield, PM .
OPERATIONS RESEARCH, 1997, 45 (05) :779-783