Flexible job-shop scheduling problem by genetic algorithm
Open Access
- 15 July 2011
- journal article
- research article
- Published by Wiley in Electrical Engineering in Japan
- Vol. 177 (3), 28-35
- https://doi.org/10.1002/eej.21194
Abstract
No abstract availableKeywords
This publication has 4 references indexed in Scilit:
- A Solution Method of Job-shop Scheduling Problems by the Idle Time Shortening Type Genetic AlgorithmIEEJ Transactions on Electronics, Information and Systems, 2005
- Effective neighbourhood functions for the flexible job shop problemJournal of Scheduling, 2000
- Genetic Algorithms and Engineering OptimizationPublished by Wiley ,1999
- Tabu search for the job-shop scheduling problem with multi-purpose machinesOR Spectrum, 1994