Robotic Flow Shop Scheduling with Parallel Machines and No-Wait Constraints in an Aluminium Anodising Plant with the CMAES Algorithm

  • Carina M. Behr
  • Jacomine GroblerEmail author
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 10841)


This paper proposes a covariance matrix adaptation evolution strategy (CMAES) based algorithm for a robotic flow shop scheduling problem with multiple robots and parallel machines. The algorithm is compared to three popular scheduling rules as well as existing schedules at a South African anodising plant. The CMAES algorithm statistically significantly outperformed all other algorithms for the size of problems currently scheduled by the anodising plant. A sensitivity analysis was also conducted on the number of tanks required at critical stages in the process to determine the effectiveness of the CMAES algorithm in assisting the anodising plant to make business decisions.


Robotic flow shop scheduling Covariance matrix adaptation evolution strategy 



This work is based on the research supported wholly or in part by the National Research Foundation of South Africa (Grant Number 109273). The authors would also like to thank the University of Twente for their financial support.


  1. 1.
    Auger, A., Hansen, N.: A restart CMA evolution strategy with increasing population size. In: Proceedings of the 2005 IEEE Congress on Evolutionary Computation, pp. 1769–1776 (2005)Google Scholar
  2. 2.
    Tang, L.X., Liu, P.: Two-machine flow shop scheduling problems involving a batching machine with transportation or deterioration consideration. Appl. Math. Model. 33, 1187–1199 (2009)MathSciNetCrossRefGoogle Scholar
  3. 3.
    Li, X., Chan, F.T.S., Chung, S.H.: Optimal multi-degree scheduling of multiple robots without overlapping in robotic flow shops with parallel machines. J. Manufact. Syst. 36, 62–75 (2015)CrossRefGoogle Scholar
  4. 4.
    Majumder, A., Laha, D.: A new cuckoo search algorithm for 2-machine robotic cell scheduling problem with sequence-dependent setup times. Swarm Evol. Comput. 28, 131–143 (2016)CrossRefGoogle Scholar
  5. 5.
    Lim, J.M.: A genetic algorithm for a single hoist scheduling in the printed-circuit-board electroplating line. Comput. Ind. Eng. 33(3–4), 789–792 (1997)CrossRefGoogle Scholar
  6. 6.
    Che, A., Lei, W., Feng, J., Chu, C.: An improved mixed integer programming approach for multi-hoist cyclic scheduling problem. IEEE Trans. Autom. Sci. Eng. 11(1), 302–309 (2014)CrossRefGoogle Scholar
  7. 7.
    Che, A., Chu, C.: Optimal scheduling of material handling devices in a PCB production line: problem formulation and a polynomial algorithm. Math. Probl. Eng. 2008 (2008). Article ID 364279MathSciNetCrossRefGoogle Scholar
  8. 8.
    Geismar, H.N., Pinedo, M., Sriskandarajah, C.: Robotic cells with parallel machines and multiple dual gripper robots: a comparative overview. IIE Trans. 40(12), 1211–1227 (2008)CrossRefGoogle Scholar
  9. 9.
    Che, A., Chu, C.: Multi-degree cyclic scheduling of a no-wait robotic cell with multiple robots. Eur. J. Oper. Res. 199(1), 77–88 (2009)MathSciNetCrossRefGoogle Scholar
  10. 10.
    Che, A., Chabrol, M., Gourgand, M., Wang, Y.: Scheduling multiple robots in a no-wait re-entrant robotic flow shop. Int. J. Prod. Econ. 135(1), 199–208 (2012)CrossRefGoogle Scholar
  11. 11.
    Zhou, Z., Che, A., Yan, P.: A mixed integer programming approach for multi-cyclic robotic flow shop scheduling with time window constraints. Appl. Math. Model. 36(8), 3621–3629 (2012)MathSciNetCrossRefGoogle Scholar
  12. 12.
    Dawande, M., Geismar, H.N., Pinedo, M., Sriskandarajah, C.: Throughput optimization in dual-gripper interval robotic cells. IIE Trans. 42(1), 1–15 (2009)CrossRefGoogle Scholar
  13. 13.
    Li, X., Fung, R.Y.: A mixed integer linear programming solution for single hoist multi-degree cyclic scheduling with reentrance. Eng. Optim. 46(5), 704–723 (2014)MathSciNetCrossRefGoogle Scholar
  14. 14.
    Kats, V., Levner, E.: Parametric algorithms for 2-cyclic robot scheduling with interval processing times. J. Sched. 14(3), 267–279 (2011)MathSciNetCrossRefGoogle Scholar
  15. 15.
    Lei, L., Wang. T.: A proof: the cyclic hoist scheduling problem is NP-complete. Graduate School of Management, Rutgers University, Working Paper, pp. 89–116 (1989)Google Scholar
  16. 16.
    Elmi, A., Topaloglu, S.: Cyclic job shop robotic cell scheduling problem: ant colony optimization. Comput. Ind. Eng. 111, 417–432 (2017)CrossRefGoogle Scholar
  17. 17.
    Chotard, A., Auger, A., Hansen, N.: Cumulative step-size adaptation on linear functions. In: Coello, C.A.C., Cutello, V., Deb, K., Forrest, S., Nicosia, G., Pavone, M. (eds.) PPSN 2012. LNCS, vol. 7491, pp. 72–81. Springer, Heidelberg (2012). Scholar
  18. 18.
    Saravanan, A.J., Karthikeyan, C.P., Samuel, A.A.: Optimization of exogenous and endogenous variables for a three column wind farm using CMAES. Appl. Mech. Mater. 573, 777–782 (2014)CrossRefGoogle Scholar
  19. 19.
    Belaqziz, S., Mangiarotti, S., Le Page, M., Khabba, S., Er-Raki, S., Agouti, T., Drapeau, L., Kharrou, M.H., El Adnani, M., Jarlan, L.: Irrigation scheduling of a classical gravity network based on the covariance matrix adaptation - evolutionary strategy algorithm. Comput. Electron. Agric. 102, 64–72 (2014)CrossRefGoogle Scholar
  20. 20.
    Grobler, J., Engelbrecht, A.P., Kok, S., Yadavalli, V.S.S.: Metaheuristics for the multi-objective FJSP with sequence-dependent set-up times, auxiliary resources and machine down time. Ann. Oper. Res. 180(1), 165–196 (2010)CrossRefGoogle Scholar

Copyright information

© Springer International Publishing AG, part of Springer Nature 2018

Authors and Affiliations

  1. 1.Department of Industrial and Systems EngineeringUniversity of PretoriaPretoriaSouth Africa

Personalised recommendations