Security based bi-objective flow shop scheduling model and its hybrid genetic algorithm

In this paper, we considered the flow shop scheduling problem with respect to the both objectives of the makespan and the mean continuous running time, proposed a security based bi-objective flow shop scheduling model. To solve the proposed model more effectively, we presented a hybrid genetic algor...

Full description

Saved in:
Bibliographic Details
Published in:Applied mathematics and computation 2014-09, Vol.243, p.637-643
Main Authors: Qing-dao-er-ji, Ren, Wang, Yuping
Format: Article
Language:English
Subjects:
Algorithms
Computation
Crossover operator
Genetic algorithm
Genetic algorithms
Local search
Mathematical models
Multi-objective flow shop scheduling
Mutation operator
Operators
Scheduling
Searching
Security
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:In this paper, we considered the flow shop scheduling problem with respect to the both objectives of the makespan and the mean continuous running time, proposed a security based bi-objective flow shop scheduling model. To solve the proposed model more effectively, we presented a hybrid genetic algorithm (HGA), which used some tailor made genetic operators and a local search operator in order to improve the local search ability of GA. The proposed algorithm is tested with some well-known problems in literature. The computational results demonstrated the effectiveness of the proposed algorithm.
ISSN:0096-3003
1873-5649
DOI:10.1016/j.amc.2014.06.019