2013 | OriginalPaper | Buchkapitel
Improved Flow Shop Schedules with Total Completion Time Criterion
verfasst von : Dipak Laha, Dhiren Kumar Behera
Erschienen in: Computational Science and Its Applications – ICCSA 2013
Verlag: Springer Berlin Heidelberg
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
The paper addresses the permutation flow shop scheduling problem with the minimization of the total completion time objective. Two heuristics are presented combining two note-worthy constructive heuristics. Exhaustive computational results on standard benchmark problems are presented. It is shown that the solutions generated are better than those obtained by the well - known heuristic in the literature. Statistical significance of better results produced by the proposed heuristics is also reported.