Skip to Main Content
ASME Press Select Proceedings

International Conference on Mechanical Engineering and Technology (ICMET-London 2011)

Editor
Garry Lee
Garry Lee
Information Engineering Research Institute
Search for other works by this author on:
ISBN:
9780791859896
No. of Pages:
906
Publisher:
ASME Press
Publication date:
2011

In the paper the effectiveness of neighborhood structures in local search algorithms for flexible job shop scheduling problem on makespan is discussed. For the analysis of the effectiveness neighborhoods N1-N4, NS and NL with GRASP algorithm were used. Experiments with different neighborhoods of the algorithm have been considered and compared. The presented neighborhoods have been tested, and illustrated with examples for serial and serial - parallel routes.

Abstract
Keywords
Introduction
Problem Formulation
Local Search and Neigborhood Structures
Computers Experiments
Multicriterial Evaluation
Conclusion
References
This content is only available via PDF.
Close Modal
This Feature Is Available To Subscribers Only

Sign In or Create an Account

Close Modal
Close Modal