Synergy of Genetic Algorithm with Extensive Neighborhood Search for the Permutation Flowshop Scheduling Problem

The permutation flowshop scheduling problem (PFSP) is an important issue in the manufacturing industry. The objective of this study is to minimize the total completion time of scheduling for minimum makespan. Although the hybrid genetic algorithms are popular for resolving PFSP, their local search m...

Full description

Bibliographic Details
Main Authors: Rong-Chang Chen, Jeanne Chen, Tung-Shou Chen, Chien-Che Huang, Li-Chiu Chen
Format: Article
Language:English
Published: Hindawi Limited 2017-01-01
Series:Mathematical Problems in Engineering
Online Access:http://dx.doi.org/10.1155/2017/3630869