Abstract
The paper presents the comparison of optimality and robustness between Greedy Randomized Adaptive Search Procedure (GRASP), Simulated Annealing (SA) and Tabu Search (TS) metaheuristics in solving of flexible job shop problem (FJSP). Each of the scheduling problems have been tested with metaheuristics and have been run a number of times to get the best solution. All the results have been analyzed on certain parameter of performance for the metaheuristics - makespan. Overall, testing showed that the TS+GRASP algorithm was slightly more competitive than the SA+GRASP algorithm in the optimality and robustness test. The robustness of the algorithm increased as the best solutions produced by the algorithm were closer to the know optimal.
Chapter PDF
Similar content being viewed by others
Keywords
References
Atallah, M.J.: Algorithms and theory of computation handbook. CRC Press, Corporate Blvd, Boca Raton (2000)
Hall, N.G., Posner, M.E.: Sensitivity analysis for scheduling problems. Journal Scheduling 7 (2004)
Kolen, A.W.J., Rinnooy Kan, A.H.G., Van Hoesel, C.P.M., Wagelmans, A.P.M.: Sensitivity analysis of list scheduling heuristics. Discrete Appl. Math. 55 (1994)
Gonzalez, T.F.: Handbook of algorithms and metaheuristics. Chapman & Hall/CRC, Boca Raton (2007)
Bondal, A.A.: Artificial immune systems applied to job shop scheduling. The Russ College of Engineering and Technology of Ohio University (2008)
Kacem, I., Hammadi, S., Borne, P.: Approach by localization and multiobjective evolutionary optimization for flexible job-shop scheduling problems. IEEE Transactions on Systems, Man and Cybernetics 32, 1–13 (2002)
Montgomery, D.C.: Design and analysis of experiments. Wiley, Chichester (2009)
Octavia, T., Sahputra, I.H.: Robust-Hybrid Denetic Algorithm for a Flow-Shop Scheduling Problem (A Case Study at PT FSCM Manufacturing Indonesia). Jurnal Teknik Industri 9, 144–151 (2007)
Talabi, E.C.: Metaheuristics. From Design to Implementation. Wiley, Chichester (2009)
Burke, E.K., Kendall, G.: Search methodologies. In: Introductory Tutorials in Optimization and Decision Support Techniques. Springer, Heidelberg (2005)
Witkowski, T., Antczak, P., Antczak, A.: Tabu search and GRASP used in hybrid procedure for optimize flexible job shop problem. In: Liu, Y., Chen, G., Ying, M. (eds.) 11th Internat. Fuzzy Systems Association - World Congress, Soft Computing and Computational Intelligence, Beijing, vol. 3, pp. 1620–1625. Tsinghua University Press/Springer (2005)
Witkowski, T., Antczak, P., Antczak, A.: The application of simulated annealing procedure for the flexible job shop scheduling problem. In: Proceedings 11th International Conference-Information Processing and Management of Uncertainty in Knowlegde Based Systems - Industrial Track, pp. 21–26 (2006)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Witkowski, T., Antczak, A., Antczak, P. (2010). Comparison of Optimality and Robustness between SA, TS and GRASP Metaheuristics in FJSP Problem. In: Huang, DS., Zhao, Z., Bevilacqua, V., Figueroa, J.C. (eds) Advanced Intelligent Computing Theories and Applications. ICIC 2010. Lecture Notes in Computer Science, vol 6215. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-14922-1_40
Download citation
DOI: https://doi.org/10.1007/978-3-642-14922-1_40
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-14921-4
Online ISBN: 978-3-642-14922-1
eBook Packages: Computer ScienceComputer Science (R0)