z-logo
open-access-imgOpen Access
Solving SDST Flow shop Scheduling Problems using Hybrid Artificial Bee Colony Algorithms
Author(s) -
Rajesh Kumar,
Gurjinder Singh,
Nitin Kumar
Publication year - 2019
Publication title -
international journal of recent technology and engineering
Language(s) - English
Resource type - Journals
ISSN - 2277-3878
DOI - 10.35940/ijrte.d8740.118419
Subject(s) - job shop scheduling , artificial bee colony algorithm , flow shop scheduling , computer science , heuristic , sequence (biology) , scheduling (production processes) , mathematical optimization , computation , job shop , algorithm , artificial intelligence , mathematics , schedule , biology , genetics , operating system
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.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here