A Simulated Annealing Algorithm for Flexible Job-Shop Scheduling Problem
Authors:
- M. YazdaniMYM. Yazdani
- M. GholamiMGM. Gholami
- M. ZandiehMZM. Zandieh
- M. MousakhaniMMM. Mousakhani
- 1 February 2009
- journal article
- Published by Science Alert in Journal of Applied Sciences
- Vol. 9 (4) , 662-670
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- A genetic algorithm for the Flexible Job-shop Scheduling ProblemComputers & Operations Research, 2008
- A hybrid genetic and variable neighborhood descent algorithm for flexible job shop scheduling problemsComputers & Operations Research, 2008
- A filtered-beam-search-based heuristic algorithm for flexible job-shop scheduling problemInternational Journal of Production Research, 2008
- Mathematical modeling and heuristic approaches to flexible job shop scheduling problemsJournal of Intelligent Manufacturing, 2007
- 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
- Routing and scheduling in a flexible job shop by tabu searchAnnals of Operations Research, 1993
- Thermodynamical approach to the traveling salesman problem: An efficient simulation algorithmJournal of Optimization Theory and Applications, 1985
- Optimization by Simulated AnnealingScience, 1983