Parallel Ant Colony Optimization for Flow Shop Scheduling Subject to Limited Machine Availability

In this paper, parallel ant colony algorithm (PAC) and parallel ant colony with local search algorithm (PACwLS) are presented and applied to Permutation Flowshop Scheduling Problem subject to limited machine availability. The objective is to minimize total flowtime criterion. This problem is proved...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	2016 IEEE International Parallel and Distributed Processing Symposium Workshops (IPDPSW) s. 756 - 765
Hlavní autoři:	Yumei Huo, Jun Xiong Huang
Médium:	Konferenční příspěvek
Jazyk:	angličtina
Vydáno:	IEEE 01.05.2016
Témata:	Algorithm design and analysis Approximation algorithms flowshop scheduling limited machine availability local search Minimization monte carlo algorithm Monte Carlo methods parallel ant colony algorithm Picture archiving and communication systems Program processors Schedules total completion time
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!

Popis
Shrnutí:	In this paper, parallel ant colony algorithm (PAC) and parallel ant colony with local search algorithm (PACwLS) are presented and applied to Permutation Flowshop Scheduling Problem subject to limited machine availability. The objective is to minimize total flowtime criterion. This problem is proved to be NP-complete in a strong sense for more than one machine even when machines are always available. PAC and PACwLS are based on the classical ant colony algorithm, but are implemented and adapted on parallel computer systems with Message Passing Interface involving the communications and collaborations of multiple computing nodes. Computational experiments show that by comparing with monte carlo algorithm, both PAC and PACwLS ourperform monte carlo algorithm, and PACwLS consistently outperforms PAC and converges faster than both PAC and monte carlo algorithm.
DOI:	10.1109/IPDPSW.2016.151