A contribution to the stochastic flow shop scheduling problem

European Journal of Operational Research

Volumn 151, Issue 2, 2003, Pages 415-433

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

^a UNIVERSITÉ CLERMONT AUVERGNE   (France)

Author keywords

Markov processes; Metaheuristics; Scheduling; Simulation; Stochastic flow shop

Indexed keywords

ALGORITHMS; COMPUTER SIMULATION; MARKOV PROCESSES; PROBLEM SOLVING;

STOCHASTIC FLOW SHOP;

SCHEDULING;

EID: 0041520963     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0377-2217(02)00835-4     Document Type: Conference Paper

References (33)

1. Bagga P.C. n jobs, 2 machines sequencing problems with stochastic service times Operations Research. 7:1970;184-197.
2. Bagga P.C. Sequencing with random service times. Technometrics. 12:1970;327-334.
3. n RAIRO APII. 25(5):1991.
4. Campbell H.G., Dudek R.A., Smith M.L. A heuristic algorithm for the. n job, m machine sequencing problem Management Science. 16(10):1970;B630-B637.
5. 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.
6. Dannenbring D.G. An evaluation of flow shop scheduling heuristics. Management Science. 23(11):1977;1174-1182.
7. G. Fleury, Méthodes stochastiques et déterministes pour les problèmes NP-difficiles, Doctorat d'informatique, Université Blaise Pascal, Clermont-Ferrand II, 1993.
8. Foley R.D., Suresh S. Stochastically minimizing the makespan in flow shops. Naval Research Logistics Quarterly. 31:1984;551-557.
9. F.G. Forst, An analysis of the two machine static stochastic flow shop with linear completion time costs, PhD Dissertation, University of Illinois at Urbana-Champaign, 1981.
10. Forst F.G. Minimizing total expected costs in the two machine, stochastic flow shop. Operations Research Letters. 2:1983;58-61.
11. Forst F.G. A review of the static stochastic job sequencing literature. Operations Research. 21:1984;127-144.
12. GOTHA, Les problèmes d'ordonnancement, RAIRO - Recherche opérationnelle, Operations Research 27 (1) (1993) 77-150.
13. 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.
14. Jia C. Minimizing variation in stochastic flow shop. Operations Research Letters. 23:1998;109-111.
15. Johnson S.M. Optimal two and three stage production schedules with setup times included. Naval Research Logistics Quarterly. 1:1954;61-68.
16. Kamburowski J. Stochastically minimizing the makespan in two-machine flow shops without blocking. European Journal of Operational Research. 112:1999;304-309.
17. Kamburowski J. On three-machine flow shops with random job processing times. European Journal of Operational Research. 125:2000;440-449.
18. Ku P.S., Niu S.C. On Johnson's two machine flow shop with random processing times. Operations Research. 34:1986;130-136.
19. Lopez P., Esquirol P. L'ordonnancement. Economica. 1999.
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. Mittal B.S., Bagga P.C. A priority problem in sequencing with stochastic services times. Operations Research. 14:1977;19-28.
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. Osman I.H., Laporte G. Metaheuristics: A bibliography. Operations Research. 63:1996;513-628.
25. Pinedo M. Minimizing the expected makespan in stochastic flow shops. Operations Research. 30:1982;148-162.
26. Pinedo M. Scheduling: Theory, Algorithms and Systems. 1995;Prentice-Hall, Englewood Cliffs, NJ.
27. Prasad V.R. n×2 flow shop sequencing problem with random processing times Operations Research. 18:1981;1-14.
28. Rodammer F.A., Preston White K. A recent survey of production scheduling. IEEE Transaction on Systems, Man and Cybernetics. 6(18):1988.
29. Shaked M., Shanthikumar J.G. Stochastic Orders and their Applications. 1994;Academic Press, Boston.
30. Talwar T.T. A note on sequencing problems with uncertain job times. Journal of the Operations Research Society of Japan. 9:1967;93-97.
31. van Laarhoven P.J.M., Aarts A.H.L. Simulated Annealing: Theory and Applications. 1987;Kluwer Academic Publishers, Dordrecht.
32. Weiss G. Multiserver stochastic scheduling. Dempster M.A.H., Lenstra J.K., Rinnooy Kan A.H.G. Deterministic and Stochastic Scheduling. 1982;157-179 D. Reidel, Dordrecht.
33. M. Widmer, Modèles mathématiques pour une gestion efficace des ateliers flexibles, PhD Dissertation, Ecole Polytechnique Fédérale de Lausanne, 1990.