Parallel hybrid metaheuristics for the flexible job shop problem
- 1 September 2010
- journal article
- Published by Elsevier BV in Computers & Industrial Engineering
- Vol. 59 (2), 323-333
- https://doi.org/10.1016/j.cie.2010.05.004
Abstract
No abstract availableKeywords
This publication has 15 references indexed in Scilit:
- A Coarse-Grain Parallel Genetic Algorithm for Flexible Job-Shop Scheduling with Lot StreamingPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2009
- Solving permutational routing problems by population-based metaheuristicsComputers & Industrial Engineering, 2008
- A hybrid genetic and variable neighborhood descent algorithm for flexible job shop scheduling problemsComputers & Operations Research, 2008
- GENACE: an efficient cultural algorithm for solving the flexible job-shop problemPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2005
- A modified genetic algorithm for distributed scheduling problemsJournal of Intelligent Manufacturing, 2003
- Approach by localization and multiobjective evolutionary optimization for flexible job-shop scheduling problemsIEEE Transactions on Systems, Man and Cybernetics, Part C (Applications and Reviews), 2002
- Effective neighbourhood functions for the flexible job shop problemJournal of Scheduling, 2000
- An integrated approach for modeling and solving the general multiprocessor job-shop scheduling problem using tabu searchAnnals of Operations Research, 1997
- Tabu search for the job-shop scheduling problem with multi-purpose machinesOR Spectrum, 1994
- Routing and scheduling in a flexible job shop by tabu searchAnnals of Operations Research, 1993