A PSO-Based Hybrid Metaheuristic for Permutation Flowshop Scheduling Problems
This paper investigates the permutation flowshop scheduling problem (PFSP) with the objectives of minimizing the makespan and the total flowtime and proposes a hybrid metaheuristic based on the particle swarm optimization (PSO). To enhance the exploration ability of the hybrid metaheuristic, a simul...
Saved in:
Main Authors: | Le Zhang, Jinnan Wu |
---|---|
Format: | Article |
Language: | English |
Published: |
Wiley
2014-01-01
|
Series: | The Scientific World Journal |
Online Access: | http://dx.doi.org/10.1155/2014/902950 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
An Improved Genetic-Shuffled Frog-Leaping Algorithm for Permutation Flowshop Scheduling
by: Peiliang Wu, et al.
Published: (2020-01-01) -
Hybrid Particle Swarm Optimization for Hybrid Flowshop Scheduling Problem with Maintenance Activities
by: Jun-qing Li, et al.
Published: (2014-01-01) -
A Genetic Algorithm to Minimize the Total Tardiness for M-Machine Permutation Flowshop Problems
by: Chia-Shin Chung, et al.
Published: (2012-01-01) -
Hybrid Metaheuristics for Solving a Fuzzy Single Batch-Processing Machine Scheduling Problem
by: S. Molla-Alizadeh-Zavardehi, et al.
Published: (2014-01-01) -
Discrete Bat Algorithm for Optimal Problem of Permutation Flow Shop Scheduling
by: Qifang Luo, et al.
Published: (2014-01-01)