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

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	Computers & operations research Ročník 35; číslo 9; s. 2807 - 2839
Hlavní autoři:	Pan, Quan-Ke, Fatih Tasgetiren, M., Liang, Yun-Chia
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	New York Elsevier Ltd 01.09.2008 Pergamon Press Inc
Témata:	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
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Buďte první, kdo okomentuje tento záznam!