You are in the accessibility menu

Please use this identifier to cite or link to this item:
Full metadata record
DC FieldValueLanguage
dc.contributor.authorFerreira, U. R.-
dc.contributor.authorBinder, Z.-
dc.contributor.authorHirsch, B. E.-
dc.contributor.authorAguilera, L. M.-
dc.identifier.citationManagement and Control of Production and Logistics, Vol 1 and 2. Amsterdam: Elsevier B.V., p. 345-350, 1998.-
dc.description.abstractMinimizing 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.en
dc.publisherElsevier B.V.-
dc.sourceWeb of Science-
dc.subjectstochastic modelingpt
dc.subjectstart intervalpt
dc.subjectgenetic algorithmspt
dc.titleStochastic scheduling - A flow shop no wait application and solutionsen
dc.contributor.institutionUniversidade Estadual Paulista (UNESP)-
dc.description.affiliationUNESP, FEG, DPD, BR-12500000 Guaratingueta, SP, Brazil-
dc.description.affiliationUnespUNESP, FEG, DPD, BR-12500000 Guaratingueta, SP, Brazil-
dc.rights.accessRightsAcesso restrito-
dc.relation.ispartofManagement and Control of Production and Logistics, Vol 1 and 2-
Appears in Collections:Artigos, TCCs, Teses e Dissertações da Unesp

There are no files associated with this item.

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.