Stochastic scheduling - A flow shop no wait application and solutions
Nenhuma Miniatura disponível
Data
1998-01-01
Autores
Orientador
Coorientador
Pós-graduação
Curso de graduação
Título da Revista
ISSN da Revista
Título de Volume
Editor
Elsevier B.V.
Tipo
Trabalho apresentado em evento
Direito de acesso
Acesso aberto
Resumo
Minimizing 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.
Descrição
Palavras-chave
Idioma
Inglês
Como citar
Management and Control of Production and Logistics, Vol 1 and 2. Amsterdam: Elsevier B.V., p. 345-350, 1998.
