This paper introduces a framework based on the collaboration of multi agent and hyper-heuristics to find a solution of the real single machine production problem. There are many techniques used to solve this problem. Each of it has its own advantages and disadvantages. By the collaboration of multi agent system and hyper-heuristics, we can get more optimal solution. The hyper-heuristics approach operates on a search space of heuristics rather than directly on a search space of solutions. The proposed framework consists of some agents, i.e. problem agent, trainer agent, algorithm agent (GPHH, GAHH, and SAHH), optimizer agent, and solver agent. Some low level heuristics used in this paper are MRT, SPT, LPT, EDD, LDD, and MON<\/p>\r\n","references":"[1] Burke E. K., Hyde M., Kendall G., Ochoa G., Ozcan E., and Qu R. \r\n\"Hyperheuristics: A Survey of the State of the Art\". 2010. \r\n[2] Burke E. K., Hart E., Kendall G., Newall J., Ross P., and S. \r\nSchulenburg. \"Hyperheuristics: An emerging direction in modern search \r\ntechnology.\" In F. Glover and G. Kochenberger (eds.), Handbook of \r\nMetaheuristics. Kluwer, pp. 457-474. 2003. \r\n[3] Silva J.D.L., Burke E.K., Petrovic S. \"An Introduction to Multiobjective \r\nMetaheuristics for Scheduling and Timetabling.\" 2005. \r\n[4] Burke E.K., Hyde M., Kendall G., Ochoa G., Ozcan E., and Woodward \r\nJ. \"Exploring hyper-heuristic methodologies with genetic \r\nprogramming.\" In Mumford C, Jain L (eds) Computational Intelligence: \r\nCollaboration, Fusion and Emergence, Intelligent Systems Reference \r\nLibrary, Springer, pp 177-201. 2009. \r\n[5] Burke E. K., Hyde M., Kendall G., Ochoa G., Ozcan E., and Qu R. \r\n\"Hyperheuristics: A Survey of the State of the Art.\" 2010. \r\n[6] Bolat, A., Al-Harkan, I., and Al-Harbi, B., (2005), \"Flow-shop \r\nScheduling for Three Serial Stations with the Last Two Duplicate \", \r\nComputers and Operations Research. 2005. \r\n[7] Blackstone J. H., Phillips D. T., and Hogg G. L. \u201cA state-of-the-art \r\nsurvey of dispatching rules for manufacturing job shop operations.\u201d In \r\nInternational Journal of Production Research, 20(1), 27-45. 1982. \r\n[8] Oliver, H., Chandrasekharan, R. \"E?cient dispatching rules for \r\nscheduling in a job shop.\" International Journal of Production \r\nEconomics, 48(1), 87-105. 1997. \r\n[9] Man K.F., Tang K.S. and Kwong S. \"Genetic Algorithms: Concepts and \r\nDesign.\" Springer. 1999. \r\n[10] Vazquez-Rodriguez J.A., Petrovic S., Salhi A. \"A combined \r\nmetaheuristic with hyper-heuristics approach to the scheduling of the \r\nhybrid ?ow shop with sequence dependent setup times and uniform \r\nmachines.\" In Proceedings of the 3rd Multidisciplinary International \r\nScheduling Conference: Theory and Applications. 2007. \r\n[11] Abednego L. \"Genetic Programming Hyper-Heuristics For Solving \r\nDynamic Production Scheduling Problem\". 2011.Proc. ICEEI 2011.\r\n[12] Ruibin Bai, Edmund K. Burke, Graham Kendall, and Barry McCollum. \r\n\"A Simulated Annealing Hyper-heuristic for University Course \r\nTimetabling.\" PATAP 2006. pp. 345-350. 2006. ","publisher":"World Academy of Science, Engineering and Technology","index":"Open Science Index 80, 2013"}