Research on flexible job-shop scheduling problem based on a modified genetic algorithm
- 1 October 2010
- journal article
- Published by Springer Science and Business Media LLC in Journal of Mechanical Science and Technology
- Vol. 24 (10), 2119-2125
- https://doi.org/10.1007/s12206-010-0526-x
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- An effective hybrid particle swarm optimization algorithm for multi-objective flexible job-shop scheduling problemComputers & Industrial Engineering, 2009
- A hybrid of genetic algorithm and bottleneck shifting for multiobjective flexible job shop scheduling problemsComputers & Industrial Engineering, 2007
- 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
- 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
- A hierarchical approach for the FMS scheduling problemEuropean Journal of Operational Research, 1995
- 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
- New trends in machine schedulingEuropean Journal of Operational Research, 1988