Simultaneous Scheduling of Machines and a Single Moving Robot in a Job Shop Environment by Metaheuristics based Clustered Holonic Multiagent Model

Houssem Eddine Nouri, Olfa Belkahla Driss, Khaled Ghédira

Abstract

In systems based robotic cells, the control of some elements such as transport robot has some difficulties when planning operations dynamically. The Job Shop scheduling Problem with Transportation times and a Single Robot (JSPT-SR) is a generalization of the classical Job Shop scheduling Problem (JSP) where a set of jobs additionally have to be transported between machines by a single transport robot. Hence, the JSPT-SR is more computationally difficult than the JSP presenting two NP-hard problems simultaneously: the job shop scheduling problem and the robot routing problem. This paper proposes a hybrid metaheuristic approach based on clustered holonic multiagent model for the JSPT-SR. Firstly, a scheduler agent applies a Neighborhood-based Genetic Algorithm (NGA) for a global exploration of the search space. Secondly, a set of cluster agents uses a tabu search technique to guide the research in promising regions. Computational results are presented using benchmark data instances from the literature of JSPT-SR. New upper bounds are found, showing the effectiveness of the presented approach.

References

  1. Abdelmaguid, T. F., Nassef, A. O., Kamal, B. A., and Hassan, M. F. (2004). A hybrid ga/heuristic approach to the simultaneous scheduling of machines and automated guided vehicles. International Journal of Production Research, 42(2):267-281.
  2. Anwar, M. F. and Nagi, R. (1998). Integrated scheduling of material handling and manufacturing activities for just-in-time production of complex assemblies. International Journal of Production Research, 36(3):653- 681.
  3. Babu, A. G., Jerald, J., Haq, A. N., Luxmi, V. M., and Vigneswaralu, T. P. (2010). Scheduling of machines and automated guided vehicles in fms using differential evolution. International Journal of Production Research, 48(16):4683-4699.
  4. Bellifemine, F., Poggi, A., and Rimassa, G. (1999). Jade - a fipa-compliant agent framework. In In Proceedings of the fourth International Conference and Exhibition on The Practical Application of Intelligent Agents and Multi-Agent Technology, pages 97-108.
  5. Bilge, U. and Ulusoy, G. (1995). A time window approach to simultaneous scheduling of machines and material handling system in an fms. Operations Research, 43(6):1058-1070.
  6. Botti, V. and Giret, A. (2008). ANEMONA: A Multiagent Methodology for Holonic Manufacturing Systems. Springer Series in Advanced Manufacturing. Springer-Verlag.
  7. Bozejko, W., Uchronski, M., and Wodecki, M. (2010). The new golf neighborhood for the flexible job shop problem. In In Proceedings of the International Conference on Computational Science, pages 289-296.
  8. Braga, R. A. M., Rossetti, R. J. F., Reis, L. P., and Oliveira, E. C. (2008). Applying multi-agent systems to simulate dynamic control in flexible manufacturing scenarios. In European Meeting on Cybernetics and Systems Research, volume 2, pages 488-493. Austrian Society for Cybernetic Studies.
  9. Calabrese, M. (2011). Hierarchical-granularity holonic modelling. Doctoral thesis, Universita degli Studi di Milano, Milano, Italy.
  10. Caumond, A., Lacomme, P., Moukrim, A., and Tchernev, N. (2009). An milp for scheduling problems in an fms with one vehicle. European Journal of Operational Research, 199(3):706-722.
  11. Deroussi, L., Gourgand, M., and Tchernev, N. (2008). A simple metaheuristic approach to the simultaneous scheduling of machines and automated guided vehicles. International Journal of Production Research, 46(8):2143-2164.
  12. Deroussi, L. and Norre, S. (2010). Simultaneous scheduling of machines and vehicles for the flexible job shop problem. In International Conference on Metaheuristics and Nature Inspired Computing, pages 1-2.
  13. Erol, R., Sahin, C., Baykasoglu, A., and Kaplanoglu, V. (2012). A multi-agent based approach to dynamic scheduling of machines and automated guided vehicles in manufacturing systems. Applied Soft Computing, 12(6):1720-1732.
  14. Ferber, J. (1999). Multi-Agent Systems: An Introduction to Distributed Artificial Intelligence. Addison-Wesley Longman Publishing Co., Inc., Boston, MA, USA, 1st edition.
  15. Giret, A. and Botti, V. (2004). Holons and agents. Journal of Intelligent Manufacturing, 15(5):645-659.
  16. Glover, F., Kelly, J. P., and Laguna, M. (1995). Genetic algorithms and tabu search: Hybrids for optimization. Computers and Operations Research, 22(1):111-134.
  17. Hurink, J. and Knust, S. (2002). A tabu search algorithm for scheduling a single robot in a job-shop environment. Discrete Applied Mathematics, 119(1-2):181-203.
  18. Hurink, J. and Knust, S. (2005). Tabu search algorithms for job-shop problems with a single transport robot. European Journal of Operational Research, 162(1):99- 111.
  19. Johnson, S. C. (1967). Hierarchical clustering schemes. Psychometrika, 32(3):241-254.
  20. Jones, A. and Rabelo, L. C. (1998). Survey of job shop scheduling techniques. Tech. rep., National Institute of Standards and Technology, Gaithersburg, USA.
  21. Koestler, A. (1967). The Ghost in the Machine. Hutchinson, London, United Kingdom, 1st edition.
  22. Komma, V. R., Jain, P. K., and Mehta, N. K. (2011). An approach for agent modeling in manufacturing on jade reactive architecture. The International Journal of Advanced Manufacturing Technology, 52(9-12):1079- 1090.
  23. Lacomme, P., Larabi, M., and Tchernev, N. (2007). A disjunctive graph for the job-shop with several robots. In Multidisciplinary International Conference on Scheduling : Theory and Applications, MISTA, pages 285-292, Paris, France.
  24. Lacomme, P., Larabi, M., and Tchernev, N. (2013). Jobshop based framework for simultaneous scheduling of machines and automated guided vehicles. International Journal of Production Economics, 143(1):24- 34.
  25. Lee, K., Yamakawa, T., and Lee, K. M. (1998). A genetic algorithm for general machine scheduling problems. In In Proceedings of the second IEEE international Conference on Knowledge-Based Intelligent Electronic Systems, pages 60-66.
  26. Lenstra, J. K. and Kan, A. H. G. R. (1979). Computational complexity of scheduling under precedence constraints. Annals of Discrete Mathematics, 4:121- 140.
  27. Lenstra, J. K. and Kan, A. H. G. R. (1981). Complexity of vehicle routing and scheduling problems. Networks, 11(2):221-227.
  28. Mastrolilli, M. and Gambardella, L. (2000). Effective neighbourhood functions for the flexible job shop problem. Journal of Scheduling, 3(1):3-20.
  29. Muth, J. F. and Thompson, G. L. (1963). Industrial Scheduling. International series in management. PrenticeHall.
  30. Pundit, R. and Palekar, U. (1990). Job shop scheduling with explicit material handling considerations. Technical report, Univ. of Illinois at Urbana-Champaign, Dept. of M. and I.E.
  31. Raman, N., Talbot, F. B., and Rachamadgu, R. V. (1986). Simultaneous scheduling of machines and material handling devices in automated manufacturing. In In Proceedings of the 2nd ORSA/TIMS Conference on Flexible Manufacturing Systems, pages 455-466.
  32. Reddy, B. S. P. and Rao, C. S. P. (2006). A hybrid multiobjective ga for simultaneous scheduling of machines and agvs in fms. The International Journal of Advanced Manufacturing Technology, 31(5-6):602-613.
  33. Sonmez, A. I. and Baykasoglu, A. (1998). A new dynamic programming formulation of (nm) flow shop sequencing problems with due dates. International Journal of Production Research, 36(8):2269-2283.
  34. Storn, R. and Price, K. (1995). Differential evolution: A simple and efficient adaptive scheme for global optimization over continuous spaces. Technical report, International Computer Science Institute, Berkeley.
  35. Ulusoy, G., Erifolu, F. S., and Bilge, U. (1997). A genetic algorithm approach to the simultaneous scheduling of machines and automated guided vehicles. Computers and Operations Research, 24(3):335-351.
  36. Zhang, Q., Manier, H., and Manier, M. A. (2012). A genetic algorithm with tabu search procedure for flexible job shop scheduling with transportation constraints and bounded processing times. Computers and Operations Research, 39(7):1713-1723.
  37. Zhang, Q., Manier, H., and Manier, M. A. (2014). A modified shifting bottleneck heuristic and disjunctive graph for job shop scheduling problems with transportation constraints. International Journal of Production Research, 52(4):985-1002.
Download


Paper Citation


in Harvard Style

Nouri H., Belkahla Driss O. and Ghédira K. (2016). Simultaneous Scheduling of Machines and a Single Moving Robot in a Job Shop Environment by Metaheuristics based Clustered Holonic Multiagent Model . In Proceedings of the 8th International Conference on Agents and Artificial Intelligence - Volume 2: ICAART, ISBN 978-989-758-172-4, pages 51-62. DOI: 10.5220/0005694300510062


in Bibtex Style

@conference{icaart16,
author={Houssem Eddine Nouri and Olfa Belkahla Driss and Khaled Ghédira},
title={Simultaneous Scheduling of Machines and a Single Moving Robot in a Job Shop Environment by Metaheuristics based Clustered Holonic Multiagent Model},
booktitle={Proceedings of the 8th International Conference on Agents and Artificial Intelligence - Volume 2: ICAART,},
year={2016},
pages={51-62},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0005694300510062},
isbn={978-989-758-172-4},
}


in EndNote Style

TY - CONF
JO - Proceedings of the 8th International Conference on Agents and Artificial Intelligence - Volume 2: ICAART,
TI - Simultaneous Scheduling of Machines and a Single Moving Robot in a Job Shop Environment by Metaheuristics based Clustered Holonic Multiagent Model
SN - 978-989-758-172-4
AU - Nouri H.
AU - Belkahla Driss O.
AU - Ghédira K.
PY - 2016
SP - 51
EP - 62
DO - 10.5220/0005694300510062