论文信息 - Scheduling Markovian PERT networks to maximize the net present value

Scheduling Markovian PERT networks to maximize the net present value

We examine project scheduling with net present value objective and exponential activity durations, using a continuous-time Markov decision chain. On the basis of a judicious partitioning of the state space, we achieve a significant performance improvement as compared to the existing algorithms.

Marc Lambrecht | Stefan Creemers | Roel Leus

[1] Meir J. Rosenblatt,et al. Activity Delay in Stochastic Project Networks , 1997, Oper. Res..

[2] Joseph G. Szmerekovsky,et al. Scheduling projects with stochastic activity duration to maximize expected net present value , 2009, Eur. J. Oper. Res..

[3] Salah E. Elmaghraby,et al. Activity networks: Project planning and control by network models , 1977 .

[4] Franz Josef Radermacher,et al. Preselective strategies for the optimization of stochastic project networks under resource constraints , 1983, Networks.

[5] Douglas R. Shier,et al. Iterative algorithms for generating minimal cutsets in directed graphs , 1986, Networks.

[6] Vidyadhar G. Kulkarni,et al. A classified bibliography of research on stochastic PERT networks: 1966-1987 , 1989 .

[7] Vidyadhar G. Kulkarni,et al. Markov and Markov-Regenerative pert Networks , 1986, Oper. Res..

[8] Erik Demeulemeester,et al. RanGen: A Random Network Generator for Activity-on-the-Node Networks , 2003, J. Sched..

[9] Marc Uetz,et al. On the generation of circuits and minimal forbidden sets , 2005, Math. Program..

[10] Rolf H. Möhring,et al. A Computational Study on Bounding the Makespan Distribution in Stochastic Project Networks , 2001, Ann. Oper. Res..