期刊
COMPUTERS & INDUSTRIAL ENGINEERING
卷 113, 期 -, 页码 10-26出版社
PERGAMON-ELSEVIER SCIENCE LTD
DOI: 10.1016/j.cie.2017.09.005
关键词
Flexible job shop scheduling; Reschedule strategy; Hybrid artificial bee colony; Cluster grouping; Tabu search
资金
- National Natural Science Foundation of China [51705385, 51705386]
- Fundamental Research Funds for the Central Universities [2017-IVA-018, 2017-IVA-016, 2016-YB-020]
This study mainly focuses on flexible job shop scheduling problems (FJSSPs) in a modern manufacturing enterprise that presents a number of different emergencies, such as new jobs inserted, old jobs cancelled, machinery breakdowns. A feasible mathematical model based on a rescheduling strategy has, been constructed as an effective solution. The rescheduling strategy is illustrated by three types of scheduling: reassembling scheduling, intersecting scheduling and inserting scheduling. The objective function is to minimize the maximum completion time (makespan). A hybrid artificial bee colony algorithm (HABC) based on Tabu search (TS) has been developed to solve the model, and a cluster grouping roulette method is proposed to better initialize the population. A crossover operator is introduced for employed bees to improve the exploitation feature. Comparative experiments with other published algorithms have been conducted on well-known benchmark instances, and the analysis results show that the HABC algorithm is efficient and effective. In addition, the proposed algorithm is applied to solve actual FJSSPs in a textile machinery manufacturing enterprise. (C) 2017 Elsevier Ltd. All rights reserved.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据