Abstract
In systems based robotic cells, the control of some elements such as transport robot has some difficulties when planning operations dynamically. The Flexible Job Shop scheduling Problem with Transportation times and Many Robots (FJSPT-MR) is a generalization of the classical Job Shop scheduling Problem (JSP) where a set of jobs have to be transported between them by several transport robots. This paper proposes hybrid metaheuristics based on clustered holonic multiagent model for the FJSPT-MR. Computational results are presented using a set of literature benchmark instances. New upper bounds are found, showing the effectiveness of the presented approach.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
References
Abdelmaguid, T.F., Nassef, A.O., Kamal, B.A., Hassan, M.F.: A hybrid GA/heuristic approach to the simultaneous scheduling of machines and automated guided vehicles. Int. J. Prod. Res. 42(2), 267–281 (2004)
Bilge, U., Ulusoy, G.: A time window approach to simultaneous scheduling of machines and material handling system in an FMS. Oper. Res. 43(6), 1058–1070 (1995)
Bozejko, W., Uchronski, M., Wodecki, M.: The new golf neighborhood for the flexible job shop problem. In: The International Conference on Computational Science, pp. 289–296 (2010)
Deroussi, L., Norre, S.: Simultaneous scheduling of machines and vehicles for the flexible job shop problem. In: International Conference on Metaheuristics and Nature Inspired Computing, Djerba, Tunisia, pp. 1–2 (2010)
Garey, M.R., Johnson, D.S., Sethi, R.: The complexity of flow shop and job shop scheduling. Math. Oper. Res. 1(2), 117–129 (1976)
Hurink, J., Knust, S.: Tabu search algorithms for job-shop problems with a single transport robot. Eur. J. Oper. Res. 162(1), 99–111 (2005)
Johnson, S.C.: Hierarchical clustering schemes. Psychometrika 32(3), 241–254 (1967)
Lacomme, P., Larabi, M., Tchernev, N.: Job-shop based framework for simultaneous scheduling of machines and automated guided vehicles. Int. J. Prod. Econ. 143(1), 24–34 (2013)
Lee, K., Yamakawa, T., Lee, K.M.: A genetic algorithm for general machine scheduling problems. In: The Second IEEE International Conference on Knowledge-Based Intelligent Electronic Systems, pp. 60–66 (1998)
Lenstra, J.K., Kan, A.H.G.R.: Complexity of vehicle routing and scheduling problems. Networks 11(2), 221–227 (1981)
Mastrolilli, M., Gambardella, L.: Effective neighbourhood functions for the flexible job shop problem. J. Sched. 3(1), 3–20 (2000)
Zhang, Q., Manier, H., Manier, M.A.: A genetic algorithm with tabu search procedure for flexible job shop scheduling with transportation constraints and bounded processing times. Comput. Oper. Res. 39(7), 1713–1723 (2012)
Zhang, Q., Manier, H., Manier, M.A.: Metaheuristics for Job Shop Scheduling with Transportation. Wiley, New York (2013). pp. 465–493. ISBN 9781118731598
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2016 Springer International Publishing Switzerland
About this paper
Cite this paper
Nouri, H.E., Driss, O.B., Ghédira, K. (2016). Optimizing Robot Movements in Flexible Job Shop Environment by Metaheuristics Based on Clustered Holonic Multiagent Model. In: Torra, V., Narukawa, Y., Navarro-Arribas, G., Yañez, C. (eds) Modeling Decisions for Artificial Intelligence. MDAI 2016. Lecture Notes in Computer Science(), vol 9880. Springer, Cham. https://doi.org/10.1007/978-3-319-45656-0_23
Download citation
DOI: https://doi.org/10.1007/978-3-319-45656-0_23
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-45655-3
Online ISBN: 978-3-319-45656-0
eBook Packages: Computer ScienceComputer Science (R0)