Ferreira, U. R.2014-05-202014-05-201998-01-01Management and Control of Production and Logistics, Vol 1 and 2. Amsterdam: Elsevier B.V., p. 345-350, 1998.http://hdl.handle.net/11449/37292Minimizing the makespan of a flow-shop no-wait (FSNW) schedule where the processing times are randomly distributed is an important NP-Complete Combinatorial Optimization Problem. In spite of this, it can be found only in very few papers in the literature. By considering the Start Interval Concept, this problem can be formulated, in a practical way, in function of the probability of the success in preserve FSNW constraints for all tasks execution. With this formulation, for the particular case with 3 machines, this paper presents different heuristics solutions: by integrating local optimization steps with insertion procedures and by using genetic algorithms for search the solution space. Computational results and performance evaluations are commented. Copyright (C) 1998 IFAC.345-350engschedulingstochastic modelingstart intervalgenetic algorithmsTrabalho apresentado em eventoWOS:000077457900058Acesso aberto