Journal of Intelligent Manufacturing

, Volume 29, Issue 8, pp 1905–1921 | Cite as

An ACO-based hyperheuristic with dynamic decision blocks for intercell scheduling

  • Yunna Tian
  • Dongni LiEmail author
  • Pengyu Zhou
  • Rongtao Guo
  • Zhaohe Liu


In real production of equipment manufacturing industry, coordination between cells is needed. Intercell scheduling therefore comes into being. In this paper, a limited intercell transportation capacity constraint is taken into consideration, a hyperheuristic is proposed, which employs ant colony optimization to select appropriate heuristic rules for production scheduling and transportation scheduling. Moreover, dynamic decision blocks are introduced to the hyperheuristic to make a better balance between optimization performance and computation efficiency. Computational results show that, as compared with other approaches, the proposed approach performs much better with respect to minimizing total weighted tardiness while retaining low computational costs, and it is especially suitable for the problems with large sizes.


Intercell scheduling Transportation capacity Decision block Hyperheuristic 



This work was supported by National Natural Science Foundation of China (71401014).


  1. Babu, S. A. K. I., Pratap, S., Lahoti, G., Fernandes, K. J., Tiwari, M. K., Mount, M., et al. (2014). Minimizing delay of ships in bulk terminals by simultaneous ship scheduling, stockyard planning and train scheduling. Maritime Economics and Logistics, 17(4), 464–492.CrossRefGoogle Scholar
  2. Barman, S. (1997). Simple priority rule combinations: An approach to improve both flow time and tardiness. International Journal of Production Research, 35(10), 2857–2870.CrossRefGoogle Scholar
  3. Burke, E. K., Gendreau, M., Hyde, M., Kendall, G., Ochoa, G., Özcan, E., et al. (2013). Hyper-heuristics: A survey of the state of the art. Journal of the Operational Research Society, 64(12), 1695–1724.CrossRefGoogle Scholar
  4. Carroll, D. C. (1965). Heuristic sequencing of jobs with single and multiple components. Cambridge, MA: Sloan School of Management, Massachusetts Institute of Technology.Google Scholar
  5. Cowling, P., Kendall, G., & Soubeiga, E. (2001). A hyperheuristic approach to scheduling a sales summit. In E. Burke & W. Erben (Eds.), Practice and theory of automated timetabling III. LNCS (Vol. 2079, pp. 176–190). Berlin: Springer.CrossRefGoogle Scholar
  6. Dorndorf, U., & Pesch, E. (1995). Evolution based learning in a job shop scheduling environment. Computers and Operations Research, 22(1), 25–40.CrossRefGoogle Scholar
  7. Elmi, A., Solimanpur, M., Topaloglu, S., & Elmi, A. (2011). A simulated annealing algorithm for the job shop cell scheduling problem with intercellular moves and reentrant parts. Computers and Industrial Engineering, 61(1), 171–178.CrossRefGoogle Scholar
  8. Fayad, C., & Petrovic, S. (2005). A fuzzy genetic algorithm for real-world job shop scheduling. In M. Ali & F. Esposito (Eds.), Innovations in applied artificial intelligence. LNCS (Vol. 3533, pp. 524–533). Berlin: Springer.CrossRefGoogle Scholar
  9. Garza, O., & Smunt, T. L. (1991). Countering the negative impact of intercell flow in cellular manufacturing. Journal of Operations Management, 10(1), 92–118.CrossRefGoogle Scholar
  10. Hong, K. S., Yeo, S., Kim, H., Chew, E., & Lee, C. (2012). Integrated inventory and transportation decision for ubiquitous supply chain management. Journal of Intelligent Manufacturing, 23(4), 977–988.CrossRefGoogle Scholar
  11. Huang, K. L., & Liao, C. J. (2008). Ant colony optimization combined with taboo search for the job shop scheduling problem. Computers and Operations Research, 35(4), 1030–1046.CrossRefGoogle Scholar
  12. Huang, J., & Süer, G. A. (2014). A dispatching rule-based genetic algorithm for multi-objective job shop scheduling using fuzzy satisfaction levels. Computers and Industrial Engineering, 86, 29–42.CrossRefGoogle Scholar
  13. Johnson, D. J., & Wemmerlöv, U. (2004). Why does cell implementation stop? Factors influencing cell penetration in manufacturing plants. Production and Operations Management, 13(3), 272–289.CrossRefGoogle Scholar
  14. Li, D., Li, M., Meng, X., & Tian, Y. (2015). A hyperheuristic approach for intercell scheduling with single processing machines and batch processing machines. IEEE Transactions on Systems, Man, and Cybernetics: Systems, 45(2), 315–325.CrossRefGoogle Scholar
  15. Li, D., Meng, X., Li, M., & Tian, Y. (2016). An ACO-based intercell scheduling approach for job shop cells with multiple single processing machines and one batch processing machine. Journal of Intelligent manufacturing, 27(2), 283–296.CrossRefGoogle Scholar
  16. Osman, I. H., & Laporte, G. (1996). Metaheuristics: A bibliography. Annals of Operations Research, 63, 513–562.CrossRefGoogle Scholar
  17. Pratap, S., Manoj, K. B., Saxena, D., & Tiwari, M. K. (2015). Integrated scheduling of rake and stockyard management with ship berthing: A block based evolutionary algorithm. International Journal of Production Research. doi: 10.1080/00207543.2015.1111535.CrossRefGoogle Scholar
  18. Saravanan, M. (2008). A scatter search method to minimise makespan of cell scheduling problem. International Journal of Agile Systems and Management, 3(1/2), 18–36.CrossRefGoogle Scholar
  19. Sarper, H., & Henry, M. C. (1996). Combinatorial evaluation of six dispatching rules in a dynamic two-machine flow shop. Omega, 24(1), 73–81.CrossRefGoogle Scholar
  20. Shiyas, C. R., & Pillai, V. M. (2014). Cellular manufacturing system design using grouping efficacy-based genetic algorithm. International Journal of Production Research, 52(12), 3504–3517.CrossRefGoogle Scholar
  21. Solimanpur, M., & Elmi, A. (2013). A tabu search approach for cell scheduling problem with makespan criterion. International Journal of Production Economics, 141(2), 639–645.CrossRefGoogle Scholar
  22. Tang, J., Wang, X., Kaku, I., & Yung, K. L. (2010). Optimization of parts scheduling in multiple cells considering intercell move using scatter search approach. Journal of Intelligent Manufacturing, 21(4), 525–537.CrossRefGoogle Scholar
  23. Tavakkoli-Moghaddam, R., Javadian, N., Khorrami, A., & Gholipour-Kanani, Y. (2010). Design of a scatter search method for a novel multi-criteria group scheduling problem in a cellular manufacturing system. Expert Systems with Applications, 37(3), 2661–2669.CrossRefGoogle Scholar
  24. Tunali, S. (1997). Evaluation of alternate routing policies in scheduling a job-shop type FMS. Computers and Industrial Engineering, 32(2), 243–250.CrossRefGoogle Scholar
  25. Vázquez, E. P., Calvo, M. P., & Ordóñez, P. M. (2015). Learning process on priority rules to solve the RCMPSP. Journal of Intelligent Manufacturing, 26(1), 123–138.CrossRefGoogle Scholar
  26. Vázquez-Rodríguez, J. A., Petrovic, S., & Salhi, A. (2007). An investigation of hyper-heuristic search spaces. In IEEE Congress on Evolutionary computation, CEC 2007 (pp. 3776–3783). IEEE.Google Scholar
  27. Vázquez-Rodríguez, J. A., & Petrovic, S. (2010). A new dispatching rule based genetic algorithm for the multi-objective job shop problem. Journal of Heuristics, 16(6), 771–793.CrossRefGoogle Scholar
  28. Vepsalainen, A. P., & Morton, T. E. (1987). Priority rules for job shops with weighted tardiness costs. Management Science, 33(8), 1035–1047.CrossRefGoogle Scholar
  29. Yang, T., Kuo, Y., & Cho, C. (2007). A genetic algorithms simulation approach for the multi-attribute combinatorial dispatching decision problem. European Journal of Operational Research, 176(3), 1859–1873.CrossRefGoogle Scholar
  30. Zeng, C., Tang, J., & Yan, C. (2014). Job-shop cell-scheduling problem with inter-cell moves and automated guided vehicles. Journal of Intelligent Manufacturing, 26, 845–859.CrossRefGoogle Scholar

Copyright information

© Springer Science+Business Media New York 2016

Authors and Affiliations

  • Yunna Tian
    • 1
    • 2
  • Dongni Li
    • 1
    Email author
  • Pengyu Zhou
    • 1
  • Rongtao Guo
    • 1
  • Zhaohe Liu
    • 1
  1. 1.Beijing Lab of Intelligent Information Technology, School of Computer ScienceBeijing Institute of TechnologyBeijingChina
  2. 2.College of Mathematics and Computer ScienceYan’an UniversityYan’anChina

Personalised recommendations