Parallel bat algorithm for optimizing makespan in job shop scheduling problems
Parallel bat algorithm for optimizing makespan in job shop scheduling problems
About this item
Full title
Author / Creator
Publisher
New York: Springer US
Journal title
Language
English
Formats
Publication information
Publisher
New York: Springer US
Subjects
More information
Scope and Contents
Contents
Parallel processing plays an important role in efficient and effective computations of function optimization. In this paper, an optimization algorithm based on parallel versions of the bat algorithm (BA), random-key encoding scheme, communication strategy scheme and makespan scheme is proposed to solve the NP-hard job shop scheduling problem. The a...
Alternative Titles
Full title
Parallel bat algorithm for optimizing makespan in job shop scheduling problems
Authors, Artists and Contributors
Author / Creator
Identifiers
Primary Identifiers
Record Identifier
TN_cdi_proquest_journals_1999510919
Permalink
https://devfeature-collection.sl.nsw.gov.au/record/TN_cdi_proquest_journals_1999510919
Other Identifiers
ISSN
0956-5515
E-ISSN
1572-8145
DOI
10.1007/s10845-015-1121-x
