A Hybrid Genetic Algorithm for the Distributed Permutation Flowshop Scheduling Problem

被引:0
作者
Li, Yan [1 ]
Chen, Zhigang [2 ]
机构
[1] Shanghai Second Polytech Univ, Dept Ind Engn, Shanghai 201209, Peoples R China
[2] Shanghai Second Polytech Univ, Dept Logist, Shanghai 201209, Peoples R China
来源
PROCEEDINGS OF THE 4TH INTERNATIONAL CONFERENCE ON INFORMATION TECHNOLOGY AND MANAGEMENT INNOVATION | 2015年 / 28卷
关键词
Distributed permutation flowshop scheduling; Genetic algorithms; Local search; Hybrid genetic algorithm;
D O I
暂无
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
For solving the distributed permutation flowshop scheduling problem (DPFSP) with the objective of minimizing makespan we design a hybrid genetic algorithm. This algorithm combines a simple genetic algorithm, a local search algorithm and a plant allocation rule with the aim of minimizing the makespan. The experimental results show that the proposed algorithm outperforms the genetic algorithm in terms of efficiency and effectiveness for parts of the data.
引用
收藏
页码:843 / 847
页数:5
相关论文
共 6 条
[1]   An efficient tabu search algorithm for the distributed permutation flowshop scheduling problem [J].
Gao, Jian ;
Chen, Rong ;
Deng, Wu .
INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 2013, 51 (03) :641-651
[2]  
Gao J, 2011, INT J COMPUT INT SYS, V4, P497
[3]   Minimising makespan in distributed permutation flowshops using a modified iterated greedy algorithm [J].
Lin, Shih-Wei ;
Ying, Kuo-Ching ;
Huang, Chien-Yi .
INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 2013, 51 (16) :5029-5038
[4]   The distributed permutation flowshop scheduling problem [J].
Naderi, B. ;
Ruiz, Ruben .
COMPUTERS & OPERATIONS RESEARCH, 2010, 37 (04) :754-768
[5]   BENCHMARKS FOR BASIC SCHEDULING PROBLEMS [J].
TAILLARD, E .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1993, 64 (02) :278-285
[6]   An effective estimation of distribution algorithm for solving the distributed permutation flow-shop scheduling problem [J].
Wang, Sheng-yao ;
Wang, Ling ;
Liu, Min ;
Xu, Ye .
INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS, 2013, 145 (01) :387-396