Longest path analysis in networks of queues: Dynamic scheduling problems

European Journal of Operational Research

Volumn 174, Issue 1, 2006, Pages 132-149

  Azaron, Amir ^a   Katagiri, Hideki ^a   Kato, Kosuke ^a   Sakawa, Masatoshi ^a  

^a HIROSHIMA UNIVERSITY   (Japan)

Author keywords

Queueing; Scheduling; Stochastic processes

Indexed keywords

MARKOV PROCESSES; PERT; POISSON DISTRIBUTION; RANDOM PROCESSES; RESOURCE ALLOCATION; SCHEDULING; STATISTICAL METHODS;

DISTRIBUTION FUNCTION; FLOW TIME DISTRIBUTION; PATH LENGTH; PROJECT COMPLETION TIME;

QUEUEING NETWORKS;

EID: 33845341476     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ejor.2005.02.018     Document Type: Article

References (23)

1. Adlakha V., and Kulkarni V. A classified bibliography of research on stochastic PERT networks: 1966-1987. INFOR 27 (1989) 272-290
2. Azaron A., and Fatemi Ghomi S. Optimal control of service rates and arrivals in Jackson networks. European Journal of Operational Research 147 (2003) 17-31
3. Azaron A., and Modarres M. Distribution function of the shortest path in networks of queues. OR Spectrum 27 (2005) 123-144
4. Azaron, A., Katagiri, H., Kato, K., Sakawa, M., in press. Modelling complex assemblies as a queueing network for lead time control. European Journal of Operational Research.
5. Barman S. Simple priority rule combinations: An approach to improve both flow time and tardiness. International Journal of Production Research 35 (1997) 2857-2870
6. Barman S. The impact of priority rule combinations on lateness and tardiness. IIE Transactions 30 (1998) 495-504
7. Burt J., and Garman M. Conditional Monte Carlo: A simulation technique for stochastic network analysis. Management Science 18 (1971) 207-217
8. Charnes A., Cooper W., and Thompson G. Critical path analysis via chance constrained and stochastic programming. Operations Research 12 (1964) 460-470
9. Elmaghraby S. On the expected duration of PERT type networks. Management Science 13 (1967) 299-306
10. Fishman G. Estimating critical path and arc probabilities in stochastic activity networks. Naval Research Logistic Quarterly 32 (1985) 249-261
11. Gross D., and Harris M. Fundamentals of queueing theory. second ed. (1985), John Wiley & Sons, New York
12. Holthaus O. Design of efficient job shop scheduling rules. Computers and Industrial Engineering 33 (1997) 249-252
13. Holthaus O., and Rajendran C. Efficient dispatching rules for scheduling in a job shop. International Journal of Production Economics 48 (1997) 87-105
14. Hopfinger E., and Steinhardt V. On the exact evaluation of finite activity networks with stochastic durations of activities. Lecture notes in economics and mathematical systems vol. 117 (1976), Springer-Verlag
15. Kleinrock L. Queueing systems. Computer applications vol. 2 (1975), John Wiley & Sons, New York
16. Kulkarni V., and Adlakha V. Markov and Markov-regenerative PERT networks. Operations Research 34 (1986) 769-781
17. Luenberger D. Introduction to dynamic systems (1979), John Wiley & Sons, New York
18. Martin J. Distribution of the time through a directed acyclic network. Operations Research 13 (1965) 46-66
19. Ord J. A simple approximation to the completion time distribution for a PERT network. Journal of Operational Research Society 42 (1991) 1011-1017
20. Rajendran C., and Holthaus O. A comparative study of dispatching rules in dynamic flowshops and jobshops. European Journal of Operational Research 116 (1999) 156-170
21. Robillard P. Expected completion time in PERT networks. Operations Research 24 (1976) 177-182
22. Soroush H. The most critical path in a PERT network. Journal of Operational Research Society 45 (1994) 287-300
23. Van Slyke R. Monte Carlo methods and the PERT problem. Operations Research 11 (1963) 839-860