An approach using particle swarm optimization and bottleneck heuristic to solve hybrid flow shop scheduling problem

Authors:
Ching-Jong Liao;Evi Tjandradjaja;Tsui-Ping Chung
Affiliations:
Department of Industrial Management, National Taiwan University of Science and Technology, Taipei, Taiwan;Department of Industrial Management, National Taiwan University of Science and Technology, Taipei, Taiwan;Department of Industrial Management, National Taiwan University of Science and Technology, Taipei, Taiwan
Venue:
Applied Soft Computing
Year:
2012

Citing 13
Cited 1

A new approach to solve hybrid flow shop scheduling problems by artificial immune system

Future Generation Computer Systems - Special issue: Computational science of lattice Boltzmann modelling
A Genetic Algorithm for Hybrid Flow-shop Scheduling with Multiprocessor Tasks

Journal of Scheduling
Fundamentals of Computational Swarm Intelligence

Fundamentals of Computational Swarm Intelligence
A discrete version of particle swarm optimization for flowshop scheduling problems

Computers and Operations Research
An effective hybrid PSO-based algorithm for flow shop scheduling with limited buffers

Computers and Operations Research
A discrete particle swarm optimization algorithm for the no-wait flowshop scheduling problem

Computers and Operations Research
A new particle swarm optimization for the open shop scheduling problem

Computers and Operations Research
A novel differential evolution algorithm for bi-criteria no-wait flow shop scheduling problems

Computers and Operations Research
A Hybrid Multi-Swarm Particle Swarm Optimization algorithm for the Probabilistic Traveling Salesman Problem

Computers and Operations Research
Discrete cooperative particle swarm optimization for FPGA placement

Applied Soft Computing
Multiprocessor task scheduling in multistage hybrid flow-shops: A parallel greedy algorithm approach

Applied Soft Computing
An efficient genetic algorithm for hybrid flow shop scheduling with multiprocessor task problems

Applied Soft Computing
PSO-Based model predictive control for nonlinear processes

ICNC'05 Proceedings of the First international conference on Advances in Natural Computation - Volume Part II

A case study on using evolutionary algorithms to optimize bakery production planning

Expert Systems with Applications: An International Journal

Quantified Score

Hi-index	0.00

Visualization

Abstract

Hybrid flow shops (HFS) are common manufacturing environments in many industries, such as the glass, steel, paper and textile industries. In this paper, we present a particle swarm optimization (PSO) algorithm for the HFS scheduling problem with minimum makespan objective. The main contribution of this paper is to develop a new approach hybridizing PSO with bottleneck heuristic to fully exploit the bottleneck stage, and with simulated annealing to help escape from local optima. The proposed PSO algorithm is tested on the benchmark problems provided by Carlier and Neron. Experimental results show that the proposed algorithm outperforms all the compared algorithms in solving the HFS problem.