A discrete particle swarm optimization algorithm for the no-wait flowshop scheduling problem

In this paper, a discrete particle swarm optimization (DPSO) algorithm is presented to solve the no-wait flowshop scheduling problem with both makespan and total flowtime criteria. The main contribution of this study is due to the fact that particles are represented as discrete job permutations and...

Full description

Saved in:

Bibliographic Details
Published in:	Computers & operations research Vol. 35; no. 9; pp. 2807 - 2839
Main Authors:	Pan, Quan-Ke, Fatih Tasgetiren, M., Liang, Yun-Chia
Format:	Journal Article
Language:	English
Published:	New York Elsevier Ltd 01.09.2008 Pergamon Press Inc
Subjects:	Algorithms Flowcharts Heuristic Job shops Makespan No-wait flowshop Operations research Optimization algorithms Particle swarm optimization Problem solving Production scheduling Scheduling Studies Total flowtime Variable neighborhood descent Makespan No-wait flowshop Total flowtime Variable neighborhood descent Particle swarm optimization
ISSN:	0305-0548, 1873-765X, 0305-0548
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!