Abstract
In this paper, a discrete artificial bee colony algorithm (DABC) is proposed to solve a distributed resource-constrained hybrid flowshop scheduling (DRCHFS) problems. The objective is to minimize the makespan. In the proposed algorithm, each solution is represented by the two-dimensional vector, and resource constraint in the decoding process is considered. Then, several different types of perturbation structures are designed to generate efficient perturbation solutions. In addition, a coding-based local search method is developed to enhance the searching abilities. Numerical experiments compare the performance of the DABC on a set of real shop scheduling system instances. The results show that the proposed approach is more effective than the other heuristic algorithms.
Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
