A hybrid artificial bee colony algorithm for the job-shop scheduling problem with no-wait constraint
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 subjec...
Saved in:
Published in | Soft computing (Berlin, Germany) Vol. 21; no. 5; pp. 1193 - 1202 |
---|---|
Main Authors | , , , , |
Format | Journal Article |
Language | English |
Published |
Berlin/Heidelberg
Springer Berlin Heidelberg
01.03.2017
Springer Nature B.V |
Subjects | |
Online Access | Get full text |
Cover
Loading…
Be the first to leave a comment!