Advertisement

An Effective Artificial Bee Colony for Distributed Lot-Streaming Flowshop Scheduling Problem

  • Jun-Hua Duan
  • Tao Meng
  • Qing-Da Chen
  • Quan-Ke Pan
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 10956)

Abstract

This paper proposes an effective discrete artificial bee colony (DABC) algorithm for solving the distributed lot-streaming flowshop scheduling problem (DLFSP) with the objective of minimizing makespan. We design a multi-list based representation to represent candidate solutions, where each list is corresponding to a factory. We present a multi-list based swap and insertion operators to generate neighboring solutions. We redesign the employ bee phase, onlooker bee phase, and scout bee phase according to the problem-specific knowledge, representation and information collected in the evolution process. The parameters for the proposed DABC algorithm are calibrated by means of a design of experiments and analysis of variance. A comprehensive computational campaign based on 810 randomly generated instances demonstrates the effectiveness of the proposed DABC algorithm for solving the DLFSP with the makespan criterion.

Keywords

Scheduling Flowshop Artificial bee colony Makespan 

Notes

Acknowledgements

This research is partially supported by the National Science Foundation of China 51575212 and 61174187, and Shanghai Key Laboratory of Power station Automation Technology.

References

  1. 1.
    Pan, Q.K., Ruiz, R.: Local search methods for the flowshop scheduling problem with flowtime minimization. Eur. J. Oper. Res. 222(1), 31–41 (2012)MathSciNetCrossRefGoogle Scholar
  2. 2.
    Wang, S.Y., Wang, L., Liu, M., Xu, Y.: An effective estimation of distribution algorithm for solving the distributed permutation flow-shop scheduling problem. Int. J. Prod. Econ. 145, 387–396 (2013)CrossRefGoogle Scholar
  3. 3.
    Naderi, B., Ruiz, R.: A scatter search algorithm for the distributed permutation flowshop scheduling problem. Eur. J. Oper. Res. 239, 323–334 (2014)MathSciNetCrossRefGoogle Scholar
  4. 4.
    Chang, J.H., Chiu, H.N.: A comprehensive review of lot streaming. Int. J. Prod. Res. 43(8), 1515–1536 (2005)CrossRefGoogle Scholar
  5. 5.
    Pan, Q.K., Ruiz, R.: An estimation of distribution algorithm for lot-streaming flow shop problems with setup times. Omega 40(2), 166–180 (2012)CrossRefGoogle Scholar
  6. 6.
    Naderi, B., Ruiz, R., Zandieh, M.: Algorithms for a realistic variant of flowshop scheduling. Comput. Oper. Res. 37, 236–246 (2010)MathSciNetCrossRefGoogle Scholar
  7. 7.
    Liu, H., Gao, L.: A discrete electromagnetism-like mechanism algorithm for solving distributed permutation flowshop scheduling problem. In: Proceedings of the 6th International Conference on Manufacturing Automation, ICMA 2010, pp. 156–163. IEEE Computer Society (2010)Google Scholar
  8. 8.
    Gao, J., Chen, R.: An NEH-based heuristic algorithm for distributed permutation flowshop scheduling problems. Technical report SRE-10-1014. College of Information Science and Technology, Dalian Maritime University, Dalian (2011)Google Scholar
  9. 9.
    Gao, J., Chen, R.: A hybrid genetic algorithm for the distributed permutation flowshop scheduling problem. Int. J. Comput. Intell. Syst. 4, 497–508 (2011)CrossRefGoogle Scholar
  10. 10.
    Gao, J., Chen, R., Deng, W., Liu, Y.: Solving multi-factory flowshop problems with a novel variable neighborhood descent algorithm. J. Comput. Inf. Syst. 8, 2025–2032 (2012)Google Scholar
  11. 11.
    Gao, J., Chen, R., Deng, W.: An efficient tabu search algorithm for the distributed permutation flowshop scheduling problem. Int. J. Prod. Res. 51, 641–651 (2013)CrossRefGoogle Scholar
  12. 12.
    Lin, S.W., Ying, K.C., Huang, C.Y.: Minimising makespan in distributed permutation flowshops using a modified iterated greedy algorithm. Int. J. Prod. Res. 51, 5029–5038 (2013)CrossRefGoogle Scholar
  13. 13.
    Fernandez-Viagas, V., Framinan, J.M.: A bounded-search iterated greedy algorithm for the distributed permutation flowshop scheduling problem. Int. J. Prod. Res. 53, 1111–1123 (2015)CrossRefGoogle Scholar
  14. 14.
    Xu, Y., Wang, L., Wang, S.Y., Liu, M.: An effective hybrid immune algorithm for solving the distributed permutation flow-shop scheduling problem. Eng. Optim. 46(9), 1269–1283 (2014)MathSciNetCrossRefGoogle Scholar
  15. 15.
    Yoon, S.H., Ventura, J.A.: Minimizing the mean weighted absolute deviation from due dates in lot-streaming flow shop scheduling. Comput. Oper. Res. 29(10), 1301–1315 (2002)MathSciNetCrossRefGoogle Scholar
  16. 16.
    Tseng, C.T., Liao, C.J.: A discrete particle swarm optimization for lot-streaming flowshop scheduling problem. Eur. J. Oper. Res. 191(2), 360–373 (2008)CrossRefGoogle Scholar
  17. 17.
    Pan, Q.K., Tasgetiren, M.F., Suganthan, P.N., Chua, T.J.: A discrete artificial bee colony algorithm for the lot-streaming flow shop scheduling problem. Inf. Sci. 181, 2455–2468 (2011)MathSciNetCrossRefGoogle Scholar
  18. 18.
    Pan, Q.K., Suganthan, P.N., Liang, J.J., Tasgetiren, M.F.: A local-best harmony search algorithm with dynamic sub-harmony memories for lot-streaming flow shop scheduling problem. Expert Syst. Appl. 38, 3252–3259 (2011)CrossRefGoogle Scholar
  19. 19.
    Meng, T., Pan, Q.K.: An improved fruit fly optimization algorithm for solving the multidimensional knapsack problem. Appl. Soft Comput. 50, 79–93 (2017)CrossRefGoogle Scholar
  20. 20.
    Han, Y.Y., Gong, D.W., Sun, X.Y., Pan, Q.K.: An improved NSGA-II algorithm for multi-objective lot-streaming flow shop scheduling problem. Int. J. Prod. Res. 52(8), 2211–2231 (2017)CrossRefGoogle Scholar
  21. 21.
    Karaboga, D.: An idea based on honey bee swarm for numerical optimization, Technical report TR06, Erciyes University, Engineering Faculty, Computer Engineering Department (2005)Google Scholar
  22. 22.
    Pan, Q.K., Wang, L., Li, J.Q., Duan, J.H.: A novel discrete artificial bee colony algorithm for the hybrid flowshop scheduling problem with makespan minimization. Omega 45, 42–56 (2014)CrossRefGoogle Scholar
  23. 23.
    Pan, Q.K., Gao, L., Li, X.Y., Gao, K.Z.: Effective metaheuristics for scheduling a hybrid flowshop with sequence-dependent setup times. Appl. Math. Comput. 303, 89–112 (2017)MathSciNetGoogle Scholar
  24. 24.
    Cui, Z., Gu, X.S.: An improved discrete artificial bee colony algorithm to minimize the makespan on hybrid flow shop problems. Neurocomputing 48(19), 248–259 (2015)CrossRefGoogle Scholar
  25. 25.
    Pan, Q.K.: An effective co-evolutionary artificial bee colony algorithm for steelmaking-continuous casting scheduling. Eur. J. Oper. Res. 250, 702–714 (2016)MathSciNetCrossRefGoogle Scholar
  26. 26.
    Ruiz, R., Stützle, T.: A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem. Eur. J. Oper. Res. 177, 2033–2049 (2007)CrossRefGoogle Scholar
  27. 27.
    Ruiz, R., Stützle, T.: An iterated greedy heuristic for the sequence dependent setup times flowshop problem with makespan and weighted tardiness objectives. Eur. J. Oper. Res. 187, 1143–1159 (2008)CrossRefGoogle Scholar
  28. 28.
    Ruiz, R., Maroto, C., Alcaraz, J.: Two new robust genetic algorithms for the flowshop scheduling problem. Omega 34, 461–476 (2006)CrossRefGoogle Scholar

Copyright information

© Springer International Publishing AG, part of Springer Nature 2018

Authors and Affiliations

  • Jun-Hua Duan
    • 1
  • Tao Meng
    • 2
  • Qing-Da Chen
    • 3
  • Quan-Ke Pan
    • 2
  1. 1.Computer CenterShanghai UniversityShanghaiPeople’s Republic of China
  2. 2.School of Mechatronic Engineering and AutomationShanghai UniversityShanghaiPeople’s Republic of China
  3. 3.State Key Laboratory of Synthetical Automation for Process IndustriesNortheastern UniversityShenyangPeople’s Republic of China

Personalised recommendations