Abstract
We face the job-shop scheduling problem with operators. To solve this problem we propose a new approach that combines a genetic algorithm with a new schedule generation scheme. We report results from an experimental study across conventional benchmark instances showing that our approach outperforms some current state-of-the-art methods. © 2011 Springer-Verlag Berlin Heidelberg.
Cite
CITATION STYLE
Mencía, R., Sierra, M. R., Mencía, C., & Varela, R. (2011). Genetic algorithm for job-shop scheduling with operators. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6687 LNCS, pp. 305–314). https://doi.org/10.1007/978-3-642-21326-7_33
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
