-Stochastic Scheduling Flow-Shop No-Wait with Heuristics Using Artificial Intelligence Techniques

  • Ubirajara Rocha Ferreira
Conference paper


This paper treats Scheduling models that can be described by considering in sequence the resources, tasks systems, sequencing constraints and performance measures. The conditions Flow-shop means that the tasks of each job should be processing sequentially, there is one machine for each task, a job is processed using one machine at a time without preemption and a machine process exactly one job at a time. The condition No-wait means that delays between tasks of the same job are not allowed. In this particular case, Flow-shop No-wait, the schedule is determined by a sequence of jobs. The Stochastic hypothesis is that: the processing times of the job i on machine j are random, according to some continuous and independent distribution functions T ij and with the realizations known only during the shop. The Objective is to minimize the expected value of the makespan, where the makespan, cmax, is the total amount of time required to completely process all the jobs [Coffman 1976, Ferreira 1990, Frostig 1985].


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. Bruno, J. L & Downey, P. J. (1986). Probabilistic bounds on the performance on list scheduling. SIAM 1. Comput. 15(2): 409–417.CrossRefGoogle Scholar
  2. Coffman Jr, E.G. (1976). Computer and lob-Shop Scheduling Theory. New York, John Wiley.Google Scholar
  3. Ferreira, U. (1990). Stochastic Scheduling Flow-shop No-wait Problems. ITA, São José dos Campos, SP, 1990. Tese de Doutorado.Google Scholar
  4. Frostig, E. &amp Adiri, I. (1985). Stochastic flow shop no-wait scheduling. J. Appl. Prob. 22: 240–246.CrossRefGoogle Scholar
  5. Goldberg, D. (1989). Genetic Algorithms in Search. Optimization and Machine Learning. Addison-Wesley.Google Scholar
  6. Hertz J.; Krogh, A & Palmer, R G. (1991). Introduction to the Theory of Neural Computation. Addison Wesley.Google Scholar
  7. Holland, J. H. (1973). Genetic algorithms and the optimal allocation of trials. SIAM Journal of Computing 2(2): 88–105.CrossRefGoogle Scholar
  8. Igelmund, G. & Radermacher, F. J. (1983). Algorithmic approaches to preselective strategies for stochastic scheduling problems, Network, 13: 29–48.CrossRefGoogle Scholar
  9. Rock, H. (1984). The three — machine no — wait flow shop is NP-Complete. Journal of the Assodation for Computing Machine, 31(2): 336–345.CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1993

Authors and Affiliations

  • Ubirajara Rocha Ferreira
    • 1
  1. 1.Engineering School/Production Dept.GuaratinguetéBrazil

Personalised recommendations