Skip to main content

Desert sparrow optimization algorithm for the bicriteria flow shop scheduling problem with sequence-independent setup time

Abstract

Bicriteria flow shop scheduling problem with sequence-independent setup time is addressed in this paper. The objective of the scheduling problem is to minimize the system utilization time relative to the minimum value of makespan. To handle both sequence-independent setup time and job processing time independently, a mixed-integer programming model has been formulated. Since the flow shop scheduling problems with sequence-independent setup time are typically NP-complete in nature, a modified heuristic based on nature-inspired Desert Sparrow Optimization (DSO) algorithm with novel initial feasible solution technique, backward to forward shift mechanism, and tie-breaking strategy, is developed and implemented in the present work to solve the aforementioned scheduling problem. Further, to optimize both the referred objectives of scheduling, the delay time for the available system of machines is formulated. A computational experiment is carried out to evaluate the performance of the proposed heuristic for up to 500 jobs and 20 machines. The comparative analysis with the help of a defined response variable average relative percentage deviation (ARPD) verifies that the proposed technique is an effective approach when compared with other constructive heuristics for referred scheduling problem of the flow shop environment.

This is a preview of subscription content, access via your institution.

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10
Fig. 11
Fig. 12

References

  1. Al-Anzi FS, Allahverdi A (2001) The relationship between three-tiered client-server internet database connectivity and two-machine flowshop. Int J Parall Distrib Syst Netw 4(2):94–101

    Google Scholar 

  2. Allahverdi A (2015) The third comprehensive survey on scheduling problems with setup times/costs. Eur J Oper Res 246:345–378

    Article  Google Scholar 

  3. Allahverdi A, Al-Anzi FS, Chen TCE (2007) The three-machine flowshop scheduling problem to minimise maximum lateness with independent setup times. Int J Oper Res 2(2):135–155

    Article  Google Scholar 

  4. Allahverdi A, Aydilek H, Aydilek A (2020) No-wait flowshop scheduling problem with separate setup times to minimize total tardiness subject to makespan. Appl Math Comput 365(C):124688

    Google Scholar 

  5. Aqil S, Allali K (2019) On a bi-criteria flow shop scheduling problem under constraints of blocking and sequence dependent setup time. Ann Oper Res. https://doi.org/10.1007/s10479-019-03490-x

    Article  Google Scholar 

  6. Azadeh A, Shoj BM, Sheikhalishahi M, Esmaili A, Ziaeifar A, Moradi B (2015) A simulation optimization approach for flow-shop scheduling problem: a canned fruit industry. Int J Adv Manuf Technol 77(1–4):751–761

    Article  Google Scholar 

  7. Bagga PC, Bhambani AM (2000) Bicriteria in a two-stage flow shop scheduling. Indian J Pure Appl Math 31(11):1475–1481

    Google Scholar 

  8. Dhouib E, Teghem J, Loukil T (2013) Minimizing the number of tardy jobs in a permutation flowshop scheduling problem with setup times and time lags constraints. J Math Model Algorit Oper Res 12(1):85–99

    Google Scholar 

  9. Dong X, Huang H, Chen P (2008) An improved NEH-based heuristic for the permutation flow shop problem. Comput Oper Res 35(12):3962–3968

    Article  Google Scholar 

  10. Eren T, Guner E (2006) A bicriteria flowshop scheduling problem with setup times. Appl Math Comput 183(1):1292–1300

    Google Scholar 

  11. Fernandez V, Framinan JM (2014) On insertion tie-breaking rules in heuristics for the permutation flow shop scheduling problem. Comput Oper Res 45(1):60–67

    Article  Google Scholar 

  12. Khatami M, Salehipour A, Hwang FJ (2019) Makespan minimization for the m-machine ordered flow shop scheduling problem. Comput Oper Res 111:400–414

    Article  Google Scholar 

  13. Li Z, Zhong RY, Barenji AV, Liu JJ, Yu CX, Huang GQ (2019) Bi-objective hybrid flow shop scheduling with common due date. Opear Res 19(1):1–26

    Google Scholar 

  14. Liu W, Jin Y, Price M (2016) A new Nawaz-Enscore-Ham-based heuristic for permutation flowshop problems with bicriteria of makespan and machine idle time. Eng Optim 46(10):1808–1822

    Article  Google Scholar 

  15. Liu W, Jin Y, Price M (2017) A new improved NEH heuristic for permutation flowshop scheduling problems. Int J Prod Econ 193(1):21–30

    Article  Google Scholar 

  16. Meng T, Pan QK, Li JQ, Sang HY (2018) An improved migrating birds optimization for an integrated lot-streaming flow shop scheduling problem. Swarm Evolut Comp 38(1):64–78

    Article  Google Scholar 

  17. Narain L (2015) Minimizing total rental cost in scheduling problems. J Comput Math Sci 6(6):280–289

    Google Scholar 

  18. Narian L, Bagga PC (2005) Flowshop/no-idle scheduling to minimize total elapsed time. J Global Optim 33(3):349–367

    Article  Google Scholar 

  19. Nawaz M, Enscore EE Jr, Ham I (1983) A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem. OMEGA Int J Manag Sci 11(1):91–95

    Article  Google Scholar 

  20. Pargar F, Zandieh M, Kauppila O, Kujala J (2018) The effect of worker learning on scheduling jobs in hybrid flow shop: a bicriteria approach. J Syst Sci Syst Eng 27(3):265–291

    Article  Google Scholar 

  21. Rao Y, Meng R, Zha J, Xu X (2020) Bi-objective mathematical model and improved algorithm for optimisation of welding shop scheduling problem. Int J Prod Res 58:2767–2783

    Article  Google Scholar 

  22. Ribas I, Companys R, Martorellc XT (2019) An iterated greedy algorithm for solving the total tardiness parallel blocking flow shop scheduling problem. Exp Syst Appl 121(1):347–361

    Article  Google Scholar 

  23. Ruiz R, Maroto C, Alcaraz J (2005) Solving the flowshop scheduling problem with sequence dependent setup times using advanced metaheuristics. Eur J Oper Res 165(1):34–54

    Article  Google Scholar 

  24. Sharma V, Reina DG, Kumar R (2017) HMADSO: a novel hill Myna and desert Sparrow optimization algorithm for cooperative rendezvous and task allocation in FANETs. Soft Comput 22(18):6191–6214

    Article  Google Scholar 

  25. Sharma S, Gupta D, Nailwal KK (2017) Bi-criteria multistage flow shop scheduling with sequence-dependent setup times. Int J Oper Res 29(1):127–147

    Article  Google Scholar 

  26. Sharma M, Sharma M, Sharma S (2020) Desert sparrow optimisation algorithm for permutation flowshop scheduling problems. Int J Math Oper Res 17(2):253–277

    Article  Google Scholar 

  27. Sharma M, Sharma M, Sharma S (2021) An improved NEH heuristic to minimize makespan for flow shop scheduling problems. Decis Sci Lett 10(3):311–322

    Article  Google Scholar 

  28. Sharma M, Sharma M, Sharma S (2021) A new heuristic for flow shop scheduling problems minimizing system utilization time subject to minimum makespan. Int J Oper Res. https://doi.org/10.1504/IJOR.2021.10035760

    Article  Google Scholar 

  29. Taillard E (1990) Some efficient heuristic methods for the flow shop sequencing problem. Eur J Oper Res 47(1):67–74

    Article  Google Scholar 

  30. Taillard E (1993) Benchmarks for basic scheduling problems. Eur J Oper Res 64(2):278–285

    Article  Google Scholar 

  31. Vanchipura R, Sridharan R (2013) Development and analysis of constructive heuristic algorithms for flow shop scheduling problems with sequence-dependent setup times. Int J Adv Manuf Technol 67(1):1337–1353

    Article  Google Scholar 

  32. Viswanath A, Sridharan R, Ram Kumar PN (2019) Hybrid genetic algorithm for multi-objective flow shop scheduling problem with sequence dependent setup time: parameter design using Taguchis robust design method. Int J Process Manag Benchmark 9(4):419

    Article  Google Scholar 

  33. Wu CC, Liu SC, Lin TY, Yang TH, Chung IH, Lin WC (2018) Bicriterion total flowtime and maximum tardiness minimization for an order scheduling problem. Comput Ind Eng 117(1):152–163

    Article  Google Scholar 

  34. Xu J, Wub CC, Yin Y, Lin WC (2017) An iterated local search for the multi-objective permutation flow shop scheduling problem with sequence-dependent setup times. Appl Soft Comput 52:39–47

    Article  Google Scholar 

  35. Yenisey MM, Yagmahan B (2014) Multi-objective permutation flow shop scheduling problem: literature review, classification and current trends. Omega 45(1):119–135

    Article  Google Scholar 

Download references

Acknowledgements

One of authors (Meenakshi Sharma) acknowledges the financial support provided by council of scientific and industrial research, New Delhi, India, in the form of SRF through grant number 09/135(0766)/2017-EMR-I.

Author information

Affiliations

Authors

Corresponding author

Correspondence to Sameer Sharma.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Reprints and Permissions

About this article

Verify currency and authenticity via CrossMark

Cite this article

Sharma, M., Sharma, M. & Sharma, S. Desert sparrow optimization algorithm for the bicriteria flow shop scheduling problem with sequence-independent setup time. Oper Res Int J (2021). https://doi.org/10.1007/s12351-021-00675-w

Download citation

Keywords

  • Scheduling
  • Bicriteria
  • Sequence-independent setup time
  • Delay time
  • Heuristic
  • Desert sparrow optimization

Mathematics Subject Classification

  • Primary: 90
  • Secondary: 90B30
  • 90B35