Journal
ENGINEERING OPTIMIZATION
Volume 47, Issue 7, Pages 927-946Publisher
TAYLOR & FRANCIS LTD
DOI: 10.1080/0305215X.2014.928817
Keywords
blocking; artificial bee colony; differential evolution; flow-shop scheduling; makespan
Funding
- National Natural Science Foundation of China [61375067]
- Fundamental Research Funds for the Central Universities [2013XK09]
Ask authors/readers for more resources
A flow-shop scheduling problem with blocking has important applications in a variety of industrial systems but is underrepresented in the research literature. In this study, a novel discrete artificial bee colony (ABC) algorithm is presented to solve the above scheduling problem with a makespan criterion by incorporating the ABC with differential evolution (DE). The proposed algorithm (DE-ABC) contains three key operators. One is related to the employed bee operator (i.e. adopting mutation and crossover operators of discrete DE to generate solutions with good quality); the second is concerned with the onlooker bee operator, which modifies the selected solutions using insert or swap operators based on the self-adaptive strategy; and the last is for the local search, that is, the insert-neighbourhood-based local search with a small probability is adopted to improve the algorithm's capability in exploitation. The performance of the proposed DE-ABC algorithm is empirically evaluated by applying it to well-known benchmark problems. The experimental results show that the proposed algorithm is superior to the compared algorithms in minimizing the makespan criterion.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available