Markovian analysis for performance evaluation and scheduling in m machine stochastic flow-shop with buffers of any capacity

European Journal of Operational Research

Volumn 161, Issue 1, 2005, Pages 126-147

  Gourgand, Michel ^a   Grangeon, Nathalie ^a   Norre, Sylvie ^a  

^a UNIVERSITÉ CLERMONT AUVERGNE   (France)

Author keywords

Flow shop; Limited buffers; Markovian analysis; No buffer; Scheduling

Indexed keywords

COMPUTATIONAL METHODS; HEURISTIC METHODS; JOB ANALYSIS; MARKOV PROCESSES; OPERATIONS RESEARCH; PERFORMANCE; SIMULATED ANNEALING;

FLOW-SHOPS; LIMITED BUFFERS; MARKOVIAN ANALYSIS; NO BUFFER;

SCHEDULING;

EID: 5144229257     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ejor.2003.08.032     Document Type: Conference Paper

References (31)

1. Bagga P.C. n jobs, 2 machines sequencing problems with stochastic service times Operations Research. 7:1970;184-197.
2. n. RAIRO APII. 25(5):1991.
3. Cunningham A.A., Dutta S.K. Scheduling jobs with exponentially distributed processing times on two machines of a flow shop. Naval Research Logistics Quarterly. 16:1973;69-81.
4. G. Fleury, Méthodes stochastiques et déterministes pour les problèmes - NP-difficiles. Ph.D. Thesis, Université Blaise-Pascal, Clermont-Ferrand II, 1993.
5. F.G. Forst, An analysis of the two machine static stochastic flow shop with linear completion time costs, Ph.D. Thesis, University of Illinois at Urbana Campaign, 1981.
6. Forst F.G. Minimizing total expected costs in the two machine stochastic flow shop. Operations Research Letters. 2:1983;58-61.
7. Forst F.G. A review of the static stochastic job sequencing literature. Operations Research. 21:1984;127-144.
8. M. Gourgand, N. Grangeon, and S. Norre, Performance evaluation and sequencing in stochastic flow shops, in: 7th International Workshop on Project Management and Scheduling (PMS2000), Osnabrück, Germany, 17-19 April, 2000, pp. 142-144.
9. Gourgand M., Grangeon N., Norre S. A review of the static stochastic flow shop scheduling problem. Journal of Decision Systems. 9(2):2000;183-214.
10. Gourgand M., Grangeon N., Norre S. A contribution to the stochastic flow shop scheduling problem. European Journal of Operational Research. 151(2):2003;415-433.
11. M. Gourgand, N. Grangeon, S. Norre, Markovian analysis for performance evaluation in two machine stochastic flow shop. In International Conference on Industrial Engineering and Production Management (IEPM 01), Quebec city, 20-23 August, 2001.
12. GOTHA. Les problèmes d'ordonnancement, RAIRO-Recherche opérationnelle, Operation Research 27 (1) (1993) 77-150.
13. Johnson S.M. Optimal two and three stage production schedules with setup times included. Naval Research Logistics Quarterly. 1:1954;61-68.
14. Kulkarni V.G., Adlakha V.G. Markov and Marko-regenerative PERT networks. Operations Research. 34(5):1986;769-781.
15. Kamburowski J. Stochastically minimizing the makespan in two-machine flow shops without blocking. European Journal of Operational Research. 112:1999;304-309.
16. Kamburowski J. On three-machine flow shops with random job processing times. European Journal of Operational Research. 125:2000;440-449.
17. Ku P.S., Niu S.C. On Johnson's two machine flow shop with random processing times. Operations Research. 34:1986;130-136.
18. Lopez P., Esquirol P. L'ordonnancement. Economica. 1999.
19. OR Library, Available from 〈 http://mscmga.ms.ic.ac.uk/info. html〉.
20. Makino T. On a scheduling problem. Journal of the Operations Research Society of Japan. 8:1965;32-44.
21. Metropolis N., Rozenbluth A., Rozenbluth M., Teller A., Teller E. Equation of state calculations by fast computing machines. Journal of Chemical Physics. 21:1953;1087-1092.
22. Osman I.H., Laporte G. Metaheuristics: A bibliography. Operation Research. 63:1996;513-628.
23. Osman I.H. An introduction to metaheuristics. Lawrence M., Wilson C. Operational Research Tutorial Papers. 1997;92-122 Operational Research Society Press, Birmingham, UK.
24. Pinedo M. Minimizing the expected makespan in stochastic flow shops. Operations Research. 30:1982;148-162.
25. Pinedo M. Scheduling: Theory, Algorithms and Systems, 1995;Prentice-Hall, Englewood Cliffs, NJ.
26. QNAP2. Manuel de référence. Copyright BULL and INRIA, 1994.
27. Shaked M., Shanthikumar J.G. Stochastic Orders and their Applications. 1994;Academic Press, Boston.
28. Talwar T.T. A note on sequencing problems with uncertain job times. Journal of the Operations Research Society of Japan. 9:1967.
29. van Laarhoven P.J.M., Aarts A.H.L. Simulated Annealing: Theory and Applications. 1987;Kluwer Academic Publishers, Dordrecht.
30. Weber R.R. The interchangeability of tandem. /M/1 queues in series. Journal of Applied Probability. 16:1979;690-695.
31. M. Widmer, Modèles mathématiques pour une gestion efficace des ateliers flexibles, Ph.D. Thesis, Ecole Polytechnique Fédérale de Lausanne, Suisse, 1990.