A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is
This paper presents the development of a hybrid discrete artificial bee colony (HDABC) algorithm for solving flow shop scheduling problem with sequence dependent setup time. The objective is to find a schedule which minimizes the make span. In the HDABC, each solution to the problem is called a food source and represented by a discrete job permutation. The algorithm has two phases namely, employed bee phase and onlooker bee phase. Iterated greedy algorithms comprised of local search proceduresfatcat:kjx267c2bzbcnhximtcw3mcuvi