Solving SDST Flow shop Scheduling Problems using Hybrid Artificial Bee Colony Algorithms
Sequence dependent setup time scheduling plays a vital role in real manufacturing industries. Setup time depends on the job sequence. Heuristic or dispatching rules are suitable for producing good initial seed sequence. For this reason, heuristic or dispatching rules based artificial bee colony algo...
Gespeichert in:
Veröffentlicht in: | International journal of recent technology and engineering 2019-11, Vol.8 (4), p.6617-6622 |
---|---|
Hauptverfasser: | , , |
Format: | Artikel |
Sprache: | eng |
Online-Zugang: | Volltext |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
Zusammenfassung: | Sequence dependent setup time scheduling plays a vital role in real manufacturing industries. Setup time depends on the job sequence. Heuristic or dispatching rules are suitable for producing good initial seed sequence. For this reason, heuristic or dispatching rules based artificial bee colony algorithm is used to minimize the makespan and total flowtime in SDST shop problems. Computation result confirms that heuristic based method produced better result when compared to the dispatching based method. The recital of the algorithms is estimated by conducting Statistical test. |
---|---|
ISSN: | 2277-3878 2277-3878 |
DOI: | 10.35940/ijrte.D8740.118419 |