Journal
COMPUTERS & INDUSTRIAL ENGINEERING
Volume 113, Issue -, Pages 10-26Publisher
PERGAMON-ELSEVIER SCIENCE LTD
DOI: 10.1016/j.cie.2017.09.005
Keywords
Flexible job shop scheduling; Reschedule strategy; Hybrid artificial bee colony; Cluster grouping; Tabu search
Funding
- National Natural Science Foundation of China [51705385, 51705386]
- Fundamental Research Funds for the Central Universities [2017-IVA-018, 2017-IVA-016, 2016-YB-020]
Ask authors/readers for more resources
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.
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