Scheduling flexible job-shops with transportation times: Mathematical models and a hybrid imperialist competitive algorithm
详细信息 查看全文
- 作者：Sajad Karimi ; Zaniar Ardalan ; B. Naderi ; bahman.naderi@aut.ac.ir ; bahman_naderi62@yahoo.com ; M. Mohammadi
- 关键词：Scheduling ; Flexible job shops ; Transportation times ; Mathematical models ; Hybrid imperialist competitive algorithm
- 刊名：Applied Mathematical Modelling
- 出版年：2017
- 出版时间：January 2017
- 年：2017
- 卷：41
- 期：Complete
- 页码：667-682
- 全文大小：1946 K
- 卷排序：41
文摘
Transportation time incorporate in flexible job shop scheduling. We mathematically formulate the problem by two mixed integer linear programming models. We propose a novel imperialist competitive algorithm hybridized by a simulated annealing. The proposed algorithm is evaluated by comparing against two high performing algorithms.