Optimal start times under stochastic activity durations

International Journal of Production Economics

Volumn 64, Issue 1, 2000, Pages 153-164

  Elmaghraby, S E ^a   Ferreira, A A ^b   Tavares, L V ^b  

^a NORTH CAROLINA STATE UNIVERSITY   (United States)

^b INSTITUTO SUPERIOR TÉCNICO   (Portugal)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION THEORY; COMPUTATIONAL METHODS; DYNAMIC PROGRAMMING; INDUSTRIAL ECONOMICS; MATHEMATICAL MODELS; PROCESS CONTROL; RANDOM PROCESSES; SCHEDULING;

ACTIVITY NETWORKS;

PRODUCTION CONTROL;

EID: 0033888813     PISSN: 09255273     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0925-5273(99)00054-7     Document Type: Article

References (17)

1. S.E. Elmaghraby, A.A. Ferreira, L.V. Tavares, Optimal activity start times under stochastic durations, Research Report (Revised), North Carolina State University, Raleigh, NC 27695-7906, USA, June 1998.
2. Malcolm D.G., Roseboom J.H., Clark C.E., Fazar W. Applications of a technique for research and development program evaluation. Operations Research. 7:1959;646-669.
3. Elmaghraby S.E., Herroelen W.J. The scheduling of activities to maximize the net present value of projects. European Journal of Operational Research. 49:1990;35-49.
4. A.A. Fernandez, The optimal solution to the resource constrained project scheduling problem with stochastic task durations, Unpublished Doctoral Dissertation, University of Central Florida, Orlando, FL 32816, USA, 1995.
5. M.R. Garey, D.S. Johnson, Computers and Intractability, Freeman & Co, San Francisco, 1979.
6. L.V. Tavares, J.A.A. Ferreira, J.S. Coelho, On the optimal management of project risk, Research Report, CESUR-IST, Lisbon, Portugal, 1997.
7. P.M. Stanfield, Production scheduling under uncertainty, unpublished Ph.D. Dissertation, North Carolina State University, Raleigh, NC 27695, USA, 1995.
8. Hodgson T.J., King R.E., Stanfield P.M. Ready-time scheduling with stochastic service times. Operations Research. 45:1997;779-783.
9. S.E. Elmaghraby, On the optimal release time problem with stochastic processing times, Research Report, North Carolina State University, Raleigh, NC 27695-7906, USA, November 1997.
10. Buss A.H., Rosenblatt M.J. Activity delay in stochastic project networks. Operations Research. 45:1997;126-139.
11. Kulkarni V.G., Adlakha V.G. Markov and Markov-regenerative PERT networks. Operations Research. 34:1986;769-781.
12. Du J., Leung Y.-T. Minimizing total tardiness on one machine is NP-Hard. Mathematical Operations Research. 15:1990;483-495.
13. Du J., Leung Y.-T., Wong C.S. Minimizing the number of late jobs with release time constraint. Journal of Combinatorial Mathematics and Combinatorial Computing. 11:1992;97-107.
14. J. Labetoulle, E.L. Lawler, J.K. Lenstra, A.H.G. Rinnooy Kan, Preemptive scheduling of uniform machines subject to release dates, in: W.R. Pulleyblank (Ed.), Progress in Combinatorial Optimization, 1984, pp. 245-261, Academic Press, New York.
15. Lawler E.L. Sequencing jobs to minimize total weighted completion time subject to precedence constraints. Annals of Discrete Mathematics. 2:1998;75-90.
16. Lenstra J.K., Rinnooy Kan A.H.G., Brucker P. Complexity of machine scheduling problem. Annals of Discrete Mathematics. 1:1997;343-362.
17. R.G. Brown, Decision Rules for Inventory Management, Dryden, Hinsdale, IL, 1967, Table VI, PP. 95-103.