A hybrid genetic and variable neighborhood descent algorithm for flexible job shop scheduling problems
Top Cited Papers
- 30 September 2008
- journal article
- Published by Elsevier BV in Computers & Operations Research
- Vol. 35 (9), 2892-2907
- https://doi.org/10.1016/j.cor.2007.01.001
Abstract
No abstract availableFunding Information
- Ministry of Education, Culture, Sports, Science and Technology (17510138)
- National Natural Science Foundation of China (70433003)
- Waseda University
This publication has 19 references indexed in Scilit:
- An effective hybrid optimization approach for multi-objective flexible job-shop scheduling problemsComputers & Industrial Engineering, 2005
- Pareto-optimality approach for flexible job-shop scheduling problems: hybridization of evolutionary algorithms and fuzzy logicMathematics and Computers in Simulation, 2002
- 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
- GA-based discrete dynamic programming approach for scheduling in FMS environmentsIEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics), 2001
- Variable neighborhood search: Principles and applicationsEuropean Journal of Operational Research, 2001
- Variable neighborhood searchComputers & 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
- Hybrid hierarchical scheduling and control systems in manufacturingIEEE Transactions on Robotics and Automation, 1990
- Performance of Hierarchical Production Scheduling PolicyIEEE Transactions on Components, Hybrids, and Manufacturing Technology, 1984