Solving SDST Flow shop Scheduling Problems using Hybrid Artificial Bee Colony Algorithms
R Sanjeev Kumar1, G Robert Singh2, N Mathan Kumar3
1R Sanjeev Kumar*, Mechanical Department, Swarnandhra College of Engineering & Technology, Narsapur, Andhra Pradesh, India.
2G Robert Singh, Mechanical Department, Swarnandhra College of Engineering & Technology, Narsapur, Andhra Pradesh, India.
3N Mathan Kumar, Mechanical Department, Akshaya College of Engineering & Technology, Coimbatore, Tamil Nadu, India.
Manuscript received on November 20, 2019. | Revised Manuscript received on November 28, 2019. | Manuscript published on 30 November, 2019. | PP: 6617-6622 | Volume-8 Issue-4, November 2019. | Retrieval Number: D8740118419/2019©BEIESP | DOI: 10.35940/ijrte.D8740.118419
Open Access | Ethics and Policies | Cite | Mendeley | Indexing and Abstracting
© The Authors. Blue Eyes Intelligence Engineering and Sciences Publication (BEIESP). This is an open access article under the CC-BY-NC-ND license (http://creativecommons.org/licenses/by-nc-nd/4.0/)
Abstract: 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.
Keywords: SDST Shop, Makespan, Total Flow Time, ABC Algorithm.
Scope of the Article: Parallel and Distributed Algorithms.