Particle Swarm Optimization Algorithm for Unrelated Parallel Machine Scheduling with Release Dates
Author
Source
Mathematical Problems in Engineering
Issue
Vol. 2013, Issue 2013 (31 Dec. 2013), pp.1-9, 9 p.
Publisher
Hindawi Publishing Corporation
Publication Date
2013-02-21
Country of Publication
Egypt
No. of Pages
9
Main Subjects
Abstract EN
We consider the NP-hard problem of minimizing makespan for n jobs on m unrelated parallel machines with release dates in this research.
A heuristic and a very effective particle swarm optimization (PSO) algorithm have been proposed to tackle the problem.
Two lower bounds have been proposed to serve as a basis for comparison for large problem instances.
Computational results show that the proposed PSO is very accurate and that it outperforms the existing metaheuristic.
American Psychological Association (APA)
Lin, Yang-Kuei. 2013. Particle Swarm Optimization Algorithm for Unrelated Parallel Machine Scheduling with Release Dates. Mathematical Problems in Engineering،Vol. 2013, no. 2013, pp.1-9.
https://search.emarefa.net/detail/BIM-1009312
Modern Language Association (MLA)
Lin, Yang-Kuei. Particle Swarm Optimization Algorithm for Unrelated Parallel Machine Scheduling with Release Dates. Mathematical Problems in Engineering No. 2013 (2013), pp.1-9.
https://search.emarefa.net/detail/BIM-1009312
American Medical Association (AMA)
Lin, Yang-Kuei. Particle Swarm Optimization Algorithm for Unrelated Parallel Machine Scheduling with Release Dates. Mathematical Problems in Engineering. 2013. Vol. 2013, no. 2013, pp.1-9.
https://search.emarefa.net/detail/BIM-1009312
Data Type
Journal Articles
Language
English
Notes
Includes bibliographical references
Record ID
BIM-1009312