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...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Computers & operations research Jg. 35; H. 9; S. 2807 - 2839
Hauptverfasser:	Pan, Quan-Ke, Fatih Tasgetiren, M., Liang, Yun-Chia
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	New York Elsevier Ltd 01.09.2008 Pergamon Press Inc
Schlagworte:	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-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!