A hybrid artificial bee colony algorithm for the job-shop scheduling problem with no-wait constraint
A hybrid artificial bee colony algorithm for the job-shop scheduling problem with no-wait constraint
About this item
Full title
Author / Creator
Publisher
Berlin/Heidelberg: Springer Berlin Heidelberg
Journal title
Language
English
Formats
Publication information
Publisher
Berlin/Heidelberg: Springer Berlin Heidelberg
Subjects
More information
Scope and Contents
Contents
This paper studies a hybrid artificial bee colony (ABC) algorithm for finding high quality solutions of the job-shop scheduling problem with no-wait constraint (JSPNW) with the objective of minimizing makespan among all the jobs. JSPNW is an extension of well-known job-shop scheduling problem subject to the constraint that no waiting time is allowe...
Alternative Titles
Full title
A hybrid artificial bee colony algorithm for the job-shop scheduling problem with no-wait constraint
Authors, Artists and Contributors
Author / Creator
Identifiers
Primary Identifiers
Record Identifier
TN_cdi_proquest_journals_2918066309
Permalink
https://devfeature-collection.sl.nsw.gov.au/record/TN_cdi_proquest_journals_2918066309
Other Identifiers
ISSN
1432-7643
E-ISSN
1433-7479
DOI
10.1007/s00500-015-1852-9
