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

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	2016 IEEE International Parallel and Distributed Processing Symposium Workshops (IPDPSW) S. 756 - 765
Hauptverfasser:	Yumei Huo, Jun Xiong Huang
Format:	Tagungsbericht
Sprache:	Englisch
Veröffentlicht:	IEEE 01.05.2016
Schlagworte:	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
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!