A review of the static stochastic flow-shop scheduling problem

Journal of Decision Systems

Volumn 9, Issue 2, 2000, Pages 1-31

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

^a UNIVERSITÉ BLAISE PASCAL   (France)

Author keywords

Breakdowns; Flow shop; Random processing times; Scheduling; Stochastic

Indexed keywords

EID: 85014751166     PISSN: 12460125     EISSN: 21167052     Source Type: Journal    
DOI: 10.1080/12460125.2000.9736710     Document Type: Article

References (48)

1. Allahverdi, A., 1995. Two stage production scheduling with separated setup time and stochastic breakdowns. Journal of the Operations Research Society, 46:896–904.
2. Allahverdi, A., 1996. Two machine proportionate flow-shop scheduling with breakdowns to minimize maximum lateness. Computers Operation Research, 23:909–916.
3. Allahverdi, A., 1997. Scheduling in stochastic flow-shops with independant setup, processing and removal times. Computers Operation Research, 24:955–960.
4. Allahverdi, A., 1999. Stochastically minimizing total flowtime in flowshops with no waiting space. European Journal of Operational Research, 113:101–112.
5. Allahverdi, A., and Mittenthal, J., 1994. Two machine ordered flow-shop scheduling under random breakdowns. Mathematical and Computer Modeling, 20:9–17.
6. Allahverdi, A., and Mittenthal, J., 1995. Scheduling on a two machine flow-shop subject to random breakdowns with a makespan objective function. European Journal of Operational Research, 81:376–387.
7. Allahverdi, A., and Mittenthal, J., 1998. Dual criteria scheduling on a two machines flowshop subject to random breakdowns. International Transactions in Operational Research, 5 (4):317–324.
8. Allahverdi, A., and Tatari, M. F., 1997. Stochastic machine dominance in flowshops. Computers Industrial Engineering, 32 (4):735–741.
9. Bagga, P. C., 1970. n jobs, 2 machines sequencing problems with stochastic service times. Operation Research, 7:184–197.
10. Bagga, P. C., 1970. Sequencing with random service times. Technometrics, 12:327–334.
11. Blazewicz, J., Ecker, K., Schmidt, G., and Weglarz, J., 1994. Scheduling in Computer and Manufacturing systems, Springer-Verlag Edition
12. Brucker, P., 1995. Scheduling Algorithms, Springer-Verlag Edition
13. Cunningham, A. A., and Dutta, S. K., 1973. Scheduling jobs with exponentially distributed processing times on two machines of a flow-shop. Naval Research Logistics Quarterly, 16:69–81.
14. Conway, R. W., Maxwell, W. L., and Miller, L. W., 1967. Theory of scheduling, Reading, Massachusetts:Addison-Wesley Publishing Company.
15. Dodin, B., 1996. Determining the optimal sequences and the distributional properties of their completion times in stochastic flow-shops. Computers Operation Research, 23 (9):829–843.
16. Frostig, E., and Adiri, I., 1985. Three machine flow-shop stochastic scheduling to minimise distribution of schedule. Naval Research Logistics Quarterly, 32:179–183.
17. Forst, F. G., 1981. An anlysis of the two machine static stochastic flow-shop with linear completion time costs, Campaign:University of Illinois at Urbana. Ph. D. Dissertation
18. Forst, F. G., 1983. Minimizing total expected costs in the two machine, stochastic flow shop. Operation Research Letters, 2:58–61.
19. Forst, F. G., 1984. A review of the static stochastic job sequencing litterature. Operation Research, 21:127–144.
20. Foley, R. D., and Suresh, S., 1984. Stochastically minimizing the makespan in flow-shops. Naval Research Logistics Quarterly, 31:551–557.
21. Gourgand, M., Grangeon, N., and Norre, S., 2000. Performance evaluation and sequencing in stochastic flow-shops. 7th International Workshop on Project Management and Scheduling (PMS2000). avril17-192000, Osnabrück, Germany. pp. 142–144.
22. Gourgand, M., Grangeon, N., and Norre, S., 2000. Une contribution au problème d'ordonnancement dans un flow-shop stochastique. Troisième Congrès de la Société Française de Recherche Opérationnelle et d'Aide à la Décision (ROADEF'2000). janvier26-282000, Nantes.
23. Gourgand, M., Grangeon, N., and Norre, S., 2001. Markovian analysis for performance evaluation in two machine stochastic flow shop. International Conference on Industrial Engineering and Production Management (IEPM 01). août20-232001, Quebec city.
24. Graham, R. H., Lawler, E. L., Lenstra, J. K., and Rinnooy Kan, A. H. G., 1979. Optimization and approximation in deterministic sequencing and scheduling theory:a survey. Ann. Discrete Math., 6:287–326.
25. GOTHA. 1993. Les problèmes d'ordonnancement. RAIRO - Recherche opérationnelle / Operation research, 27 (1):77–150.
26. Jia, C., 1998. Minimizing variation in stochastic flow-shop. Operation Research Letters, 23:109–111.
27. Johnson, S. M., 1954. Optimal two and three stage production schedules with setup times included. Naval Research Logistics Quartely, 1:61–68.
28. Kamburowski, J., 1999. Stochastically minimizing the makespan in two-machine flowshops without blocking. European Journal of Operational Research, 112:304–309.
29. Kamburowski, J., 2000. On three-machine flow-shops with random job processing times. European Journal of Operational Research, 125:440–449.
30. Kouvelis, P., Daniels, R., and Vairaktarakis, G., 2000. Robust scheduling of a two machine flow-shop with uncertain processing times. IIE Transactions, 32:421–432.
31. Ku, P. S., and Niu, S. C., 1986. On Johnson's two machine flow-shop with random processing times. Operation Research, 34:130–136.
32. Lopez, P., and Esquirol, P., 1999. L'ordonnancement. Economica
33. Makino, T., 1965. On a scheduling problem. Journal of the Operations Research Society of Japan, 8:32–44.
34. Mittal, B. S., and Bagga, P. C., 1977. A priority problem in sequencing with stochastic services times. Operation Research, 14:19–28.
35. Pinedo, M., 1982. Minimizing the expected makespan in stochastic flow-shops. Operation Research, 30:148–162.
36. Pinedo, M., 1995. Scheduling:Theory, Algorithms and Systems, Englewood Cliffs, NJ:Prentice-Hall.
37. Prasad, V. R., 1981. nx2 flow-shop sequencing problem with random processing times. Operation Research, 18:1–14.
38. Rinnooy Kan, A. H. G., 1976. Machine scheduling problem:classification, complexity and computations, The Hague, Netherlands:Martinus Nijhoff.
39. Rodammer, F. A., and Preston White, K., 1988. A recent survey of production scheduling. IEEE transaction on systems, man and cybernetics, 6 (18)
40. Sule, D. R., and Huang, K. Y., 1983. Sequencing on two and three machines with setup, processing and removal times separated. International Journal of Production Research, 21 (5):723–732.
41. Smith, M. L., Panwalkar, S. S., and Dudek, R. A., 1975. Flowshop sequencing problem with ordered processing times matrices. Management Science, 21:544–549.
42. Shaked, M., and Shanthikumar, J. G., 1994. Stochastic Orders and their Applications, Boston:Academic Press.
43. Talwar, T. T., 1967. A note on sequencing problems with uncertain job times. Journal of the Operations Research Society of Japan, 9:93–97.
44. Weber, R. R., 1979. The interchangeability of tandem./M/1 queues in series. Journal of Applied Probability, 16:690–695.
45. Weiss, G., 1982. “ Multiserver stochastic scheduling ”. In Deterministic and stochastic scheduling, Edited by:Dempster, M. A. H., Lenstra, J. K., and Rinnooy Kan, A. H. G., 157–179. Dordrecht:D.Reidel.
46. Wang, K. S., Hsia, H. W., and Zhuang, Z. D., 1993. An intelligent decision system for a modern manufacturing system. International Journal of Computer Integrated Manufacturing, 5 (6):281–292.
47. Widmer, M., 1990. Modèles mathématiques pour une gestion efficace des ateliers flexibles, Ecole Polytechnique Fédérale de Lausanne. Doctorat en sciences techniques
48. Yoshida, T., and Hitomi, K., 1979. Optimal two-stage production scheduling with setup times included. AIIE Transactions, 11 (3):261–263.