A Hybrid Genetic Algorithm for the Distributed Permutation Flowshop Scheduling Problem
被引:0
作者:
Li, Yan
论文数: 0引用数: 0
h-index: 0
机构:
Shanghai Second Polytech Univ, Dept Ind Engn, Shanghai 201209, Peoples R ChinaShanghai Second Polytech Univ, Dept Ind Engn, Shanghai 201209, Peoples R China
Li, Yan
[1
]
Chen, Zhigang
论文数: 0引用数: 0
h-index: 0
机构:
Shanghai Second Polytech Univ, Dept Logist, Shanghai 201209, Peoples R ChinaShanghai Second Polytech Univ, Dept Ind Engn, Shanghai 201209, Peoples R China
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卷
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.