Springer Nature is making SARS-CoV-2 and COVID-19 research free. View research | View latest news | Sign up for updates

A bi-objective imperialist competitive algorithm for no-wait flexible flow lines with sequence dependent setup times

  • 239 Accesses

  • 7 Citations

Abstract

In field of scheduling, the majority of papers have assumed that setup times are negligible or independent of job sequence and can be added to processing times. While in some industries like textile, chemical, and automobile manufacturing, setup time is an important factor and must not be ignored. Despite its importance from both practical and academic aspects, multi-objective no-wait flexible flow line scheduling problems with sequence-dependent setup times have been given less attention. This paper considers this problem where the objective is to minimize both makespan and total tardiness. The problem is first mathematically formulated the problem as a mixed integer linear programming model. A novel bi-objective imperialist competitive algorithm is developed. This algorithm employs three advance mechanisms of imperialist behavior, imperialist completion, and independence. The algorithm is carefully evaluated for its performance against two well-known multi-objective algorithms. The results show that the proposed algorithm outperforms the other algorithms.

This is a preview of subscription content, log in to check access.

References

  1. 1.

    Chan FTS, Chan HK (2012) The performance of combinatorial priority rules in a manufacturing flow shop. Eur J Ind Eng 6(5):572–595

  2. 2.

    Chan FTS, Wong TC, Chan LY (2008) Lot streaming for product assembly in jobshop environment. Rob Comput Int Manuf 24(3):321–331

  3. 3.

    Chan FTS, Wong TC, Chan LY (2009) An evolutionary algorithm for assembly job shop with part sharing. Comput Ind Eng 57(3):641–651

  4. 4.

    Wong TC, Chan FTS, Chan LY (2009) Are source-constrained assembly job shop scheduling problem with lot streaming technique. Comput Ind Eng 57(3):983–995

  5. 5.

    Chan FTS, Choy KL, Bibhushan (2011) A genetic algorithm-based scheduler for multiproduct parallel machine sheet metal job shop. Exp Syst Appl 38(7):8703–8715

  6. 6.

    Wong CS, Chan FTS, Chung SH (2012) Joint scheduling approach for production-maintenance scheduling with setup constraints, The 13th Asia Pacific Industrial Engineering and Management Systems Conference (APIEMS 2012) and The 15th Asia Pacific Regional Meeting of the International Foundation for Production Research, Patong Beach, Phuket, Thailand, 754–760

  7. 7.

    Wismer DA (1972) Solution of flowshop-scheduling problem with no intermediate queues. Oper Res 20:689–697

  8. 8.

    Liesegan G, Ruger M (1972) Flowshop sequencing problem with no wait in process. Oper Res Q 23:591–598

  9. 9.

    Bonney MC, Gundry SW (1976) Solutions to constrained flowshop sequencing problem. Oper Res Q 27:869–883

  10. 10.

    Li X, Wang Q, Wu C (2008) Heuristic for no-wait flow shops with make span minimization. Int J Prod Res 46(9):2519–2530

  11. 11.

    Aldowaisan T, Allahverdi A (2004) New heuristics for m-machine no-wait flowshop to minimize total completion time. Omega 32(5):345–352

  12. 12.

    Schuster CJ, Framinan JM (2003) Approximate procedure for no-wait job shop scheduling. Oper Res Lett 31:308–318

  13. 13.

    Pan QK, Tasgetiren MF, Liang YC (2008) A discrete particle swarm optimization algorithm for the no-wait flowshop scheduling problem. Comput Oper Res 35:2807–2839

  14. 14.

    Fink A, Voß S (2003) Solving the continuous flow-shop scheduling problem by metaheuristics. Eur J Oper Res 151:400–414

  15. 15.

    Shyu SJ, Lin BMT, Yin PY (2004) Application of ant colony optimization for no-wait flowshop scheduling problem to minimize the total completion time. Comput Ind Eng 47:181–193

  16. 16.

    Grabowski J, Pempera J (2005) Some local search algorithms for no-wait flow-shop problem with make span criterion. Comput Oper Res 32:2197–2212

  17. 17.

    Tavakkoli-Moghaddam R, Vahed AR, Hossein Mirzaei A (2007) A hybrid multi-objective immune algorithm for a flow shop scheduling problem with bi-objectives: weighted mean completion time and weighted mean tardiness. Info Sci 177:5072–5090

  18. 18.

    Nagano MS, Silva AA, Lorena LAN (2012) A new evolutionary clustering search for a no-wait flow shop problem with set-up times. Eng App Arti Int 25(6):1114–1120

  19. 19.

    Davendra D, Zelink I, Davendra MB, Senkerik R, Jasek R (2013) Discrete self-organising migrating algorithm for flow-shop scheduling with no-wait make span. Math Comput Model 57:100–110

  20. 20.

    Aydilek H, Allahverdi A (2012) Heuristics for no-wait flowshops with make span subject to mean completion time. App Math Comput 219:351–359

  21. 21.

    Liu G, Song S, Wu C (2013) Some heuristics for no-wait flowshops with total tardiness criterion. Comput Oper Res 40:521–525

  22. 22.

    Wagner HM (1959) An integer linear-programming model for machine scheduling. Naval Res Log Q 6(2):131–140

  23. 23.

    Pan CH (2007) A study of integer programming formulations for scheduling problems. Int J Syst Sci 28(1):33–41

  24. 24.

    Atashpaz-Gargari E, Lucas C (2007) Imperialist competitive algorithm: an algorithm for optimization inspired by imperialistic competition. IEEE Congr Evol Comput Singapore, pp. 4661–4667

  25. 25.

    Atashpaz-Gargari E, Hashemzadeh F, Rajabioun R, Lucas C (2008) Colonial competitive algorithm, a novel approach for PID controller design in MIMO distillation column process. Int J Intell Comput Cybern 1(3):337–355

  26. 26.

    Bagher M, Zandieh M, Farsijani H (2010) Balancing of stochastic U-type assembly lines: an imperialist competitive algorithm. Int J Adv Manuf Technol 54:271–285

  27. 27.

    Banisadr AH, Zandieh M, Mahdavi I (2013) A hybrid imperialist competitive algorithm for single-machine scheduling problem with linear earliness and quadratic tardiness penalties. doi:10.1007/s00170-012-4233-x

  28. 28.

    Zhou W, Yan J, Li Y, Xia C, Zheng J (2013) Imperialist competitive algorithm for assembly sequence planning. Int J Adv Manuf Technol. doi:10.1007/s00170-012-4641-y

  29. 29.

    Frutos M, Carolina Olivera A, Tohmé F (2010) Amemetic algorithm based on a NSGAII scheme for the flexible job-shop scheduling problem. Ann Oper Res 181(1):745–765

  30. 30.

    Khalili M, Tavakoli-Moghadam R (2012) A multi-objective electromagnetism algorithm for a bi-objective flowshop scheduling problem. J Manuf Syst 31:232–239

  31. 31.

    Zitzler E, Thiele L (1999) Multi-objective evolutionary algorithms: a comparative case study and the strength Pareto approach. IEEE Trans Evol Comput 3:257–271

  32. 32.

    Knowles J, Thiele L, Zitzler E (2006) A tutorial on the performance assessment of stochastic multi-objective optimizers. Technical Report 214. Computer Engineering and Networks Laboratory (TIK). ETH Zurich

  33. 33.

    Montgomery DC (2000) Design and analysis of experiments. Fifth edition, John Wiley & Sons

Download references

Author information

Correspondence to Majid Khalili.

Rights and permissions

Reprints and Permissions

About this article

Verify currency and authenticity via CrossMark

Cite this article

Khalili, M., Naderi, B. A bi-objective imperialist competitive algorithm for no-wait flexible flow lines with sequence dependent setup times. Int J Adv Manuf Technol 76, 461–469 (2015). https://doi.org/10.1007/s00170-014-6305-6

Download citation

Keywords

  • Flexible flow lines
  • Sequence-dependent setup times
  • Mathematical formulation
  • Bi-objective imperialist competitive algorithm