Nothing Special   »   [go: up one dir, main page]
Skip to main content
Springer Nature Link
Log in

General variable neighborhood search algorithm to minimize makespan of the distributed no-wait flow shop scheduling problem

  • Production Management
  • Published:
Production Engineering Aims and scope Submit manuscript

Abstract

This paper addresses minimizing makespan of the distributed no-wait flow shop scheduling problem where there are several identical factories that work in parallel. There are jobs with series of operations that should be allocated to one of these factories and all operations of jobs should be performed in the allocated factories. After starting the first operation of the job, all other operations of the job should be processed without any interruption or delay. The goal is finding allocation and sequence of jobs on each factory such that the completion time of the last job processed in the system is minimized. For the addressed problem, several heuristics available in the literature developed to solve the classical no-wait flowshop scheduling problem have been extended to the addressed problem. Due to NP-hard nature of the addressed problem, a metaheuristic algorithm called General Variable Neighbourhood Search (GVNS) has been proposed which similar to Variable Neighbourhood Search (VNS) algorithm has shaking procedure and local search algorithm but the severity of the shaking procedure depending on the progress of incumbent solution changes. Also, time-saving strategies that allow focusing on promising movements in the search algorithm, as well as the shaking producer of the proposed GVNS algorithm, are incorporated. The performance of the heuristic algorithms and GVNS thorough comprehensive benchmark problems are presented.

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

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6

Similar content being viewed by others

Notes

  1. In this paper, the proposed algorithm and ICG are not compared due to emergence of ICG after completing experiments and submission of the paper.

References

  1. Allahverdi A (2016) A survey of scheduling problems with no-wait in process. Eur J Oper Res, 255(3):665–686

  2. Aldowaisan T, Allahverdi A (2003) New heuristics for no-wait flow shops to minimize makespan. Comput Oper Res 30:1219–1231

    Article  MATH  Google Scholar 

  3. Campbell HG, Dudek RA, Smith ML (1970) A heuristic algorithm for the n job, m machine sequencing problem. Manag Sci, 16(10): B–630

    Article  MATH  Google Scholar 

  4. Chan HK, Chung SH (2013) Optimisation approaches for distributed scheduling problems. Int J Prod Res 51(9):2571–2577

    Article  Google Scholar 

  5. Da Silva RF, Urrutia S (2010) A General VNS heuristic for the traveling salesman problem with time windows. Discret Optim 7(4):203–211

    Article  MathSciNet  MATH  Google Scholar 

  6. de Armas J, Melián-Batista B, Moreno-Pérez JA, Brito J (2015) GVNS for a real-world Rich Vehicle Routing Problem with Time Windows. Eng Appl Artif Intell 42:45–56

    Article  Google Scholar 

  7. Ding JY, Song S, Gupta JN, Zhang R, Chiong R, Wu C (2015) An improved iterated greedy algorithm with a Tabu-based reconstruction strategy for the no-wait flowshop scheduling problem. Appl Soft Comput 30:604–613

    Article  Google Scholar 

  8. Dong X, Nowak M, Chen P, Lin Y (2015) Self-adaptive perturbation and multi-neighborhood Search for Iterated Local Search on the permutation flow shop problem. Comput Ind Eng 87:176–185

    Article  Google Scholar 

  9. Ekşioğlu B, Ekşioğlu SD, Jain P (2008) A tabu search algorithm for the flowshop scheduling problem with changing neighborhoods. Comput Ind Eng 54(1):1–11

    Article  Google Scholar 

  10. Fernandez-Viagas V, Framinan JM (2015) A bounded-search iterated greedy algorithm for the distributed permutation flowshop scheduling problem. Int J Prod Res 53(4):1111–1123

    Article  Google Scholar 

  11. Framinan JM, Gupta JN, Leisten R (2004) A review and classification of heuristics for permutation flow-shop scheduling with makespan objective. J Oper Res Soc 55(12):1243–1255

    Article  MATH  Google Scholar 

  12. Framinan JM, Nagano MS (2008) Evaluating the performance for makespan minimisation in no-wait flowshop sequencing. J Mater Process Technol 197(1):1–9

    Article  Google Scholar 

  13. Gangadharan R, Rajendran C (1993) Heuristic algorithms for scheduling in no-wait flow shop. Int J Product Econ 32:285–290

    Article  Google Scholar 

  14. Gao J, Chen R, Deng W (2013) An efficient tabu search algorithm for the distributed permutation flowshop scheduling problem. Int J Prod Res 51(3):641–651

    Article  Google Scholar 

  15. Garey MR, Johnson DS, Sethi R (1976) The complexity of flowshop and jobshop scheduling. Math Oper Res 1(2):117–129

    Article  MathSciNet  MATH  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  17. Gupta JN, Stafford EF (2006) Flowshop scheduling research after five decades. Eur J Oper Res 169(3):699–711

    Article  MATH  Google Scholar 

  18. Hall NG, Sriskandarajah C (1996) A survey of machine scheduling problems with blocking and no-wait in process. Oper Res 44:510–525

    Article  MathSciNet  MATH  Google Scholar 

  19. Hansen P, Mladenović N (2001) Variable neighborhood search: principles and applications. Eur J Oper Res 130(3):449–467

    Article  MathSciNet  MATH  Google Scholar 

  20. Hansen P, Mladenović N, Pérez JAM (2010) Variable neighbourhood search: methods and applications. Ann Oper Res 175(1):367–407

    Article  MathSciNet  MATH  Google Scholar 

  21. Hansen P, Oğuz C, Mladenović N (2008) Variable neighborhood search for minimum cost berth allocation. Eur J Oper Res 191(3):636–649

    Article  MATH  Google Scholar 

  22. Hejazi SR, Saghafian S (2005) Flowshop-scheduling problems with makespan criterion: a review. Int J Prod Res 43(14):2895–2929

    Article  MATH  Google Scholar 

  23. Jarboui B, Eddaly M, Siarry P (2011) A hybrid genetic algorithm for solving no-wait flowshop scheduling problems. The Int J Adv Manuf Technol 54(9–12):1129–1143

    Article  Google Scholar 

  24. Johnson SM (1954) Optimal two-and three-stage production schedules with setup times included. Nav Res Logist Q 1(1):61–68

    Article  MATH  Google Scholar 

  25. King JR, Spachis AS (1980) Heuristics for flow shop scheduling. Int J Prod Res 18:343–357

    Google Scholar 

  26. Komaki GM, Mobin S, Teymourian E, Sheikh S (2015) A General Variable Neighborhood Search Algorithm to Minimize Makespan of the Distributed Permutation Flowshop Scheduling Problem. World Acad Sci Eng and Technol Int J Soc Behav Educ Econ Bus Ind Eng 9(8):2701–2708

    Google Scholar 

  27. Laha D, Chakraborty UK (2009) A constructive heuristic for minimizing makespan in no-wait flow shop scheduling. The International Journal of Advanced Manufacturing Technology 41(1–2):97–109

    Article  Google Scholar 

  28. Laha D, Gupta JN, Sapkal SU (2014) A penalty-shift-insertion-based algorithm to minimize total flow time in no-wait flow shops. J Oper Res Soc 65(10):1611–1624

    Article  Google Scholar 

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

    Article  MATH  Google Scholar 

  30. Lin SW, Ying KC, Huang CY (2013) Minimising makespan in distributed permutation flowshops using a modified iterated greedy algorithm. Int J Prod Res 51(16):5029–5038

    Article  Google Scholar 

  31. Lin SW, Ying KC (2016) Minimizing makespan for solving the distributed no-wait flowshop scheduling problem. Comput Ind Eng 99:202–209

    Article  Google Scholar 

  32. Liu B, Wang L, Jin YH (2007) An effective hybrid particle swarm optimization for no-wait flow shop scheduling. Int J Adv Manuf Technol 31(9–10):1001–1011

    Article  Google Scholar 

  33. M’Hallah R (2014) Minimizing total earliness and tardiness on a permutation flow shop using VNS and MIP. Comput Ind Eng 75:142–156

    Article  Google Scholar 

  34. M’Hallah R (2014) An iterated local search variable neighborhood descent hybrid heuristic for the total earliness tardiness permutation flow shop. Int J Prod Res 52(13):3802–3819

    Article  Google Scholar 

  35. Mladenović N, Hansen P (1997) Variable neighborhood search. Comput Oper Res 24(11):1097–1100

    Article  MathSciNet  MATH  Google Scholar 

  36. Naderi B, Ruiz R (2010) The distributed permutation flowshop scheduling problem. Comput Oper Res 37(4):754–768

    Article  MathSciNet  MATH  Google Scholar 

  37. Naderi B, Ruiz R (2014) A scatter search algorithm for the distributed permutation flowshop scheduling problem. Eur J Oper Res 239(2):323–334

    Article  MathSciNet  MATH  Google Scholar 

  38. Nawaz M, Enscore EE, Ham I (1983) A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem. Omega 11(1):91–95

    Article  Google Scholar 

  39. Nowicki E, Smutnicki C (1996) A fast tabu search algorithm for the permutation flow-shop problem. Eur J Oper Res 91(1):160–175

    Article  MATH  Google Scholar 

  40. Osman IH, Potts CN (1989) Simulated annealing for permutation flow-shop scheduling. Omega 17(6):551–557

    Article  Google Scholar 

  41. Palmer D (1965) Sequencing jobs through a multi-stage process in the minimum total time–a quick method of obtaining a near optimum. OR 16(1):101–107

  42. Pan Q-K, Tasgetiren MF, Liang Y-C (2005) A discrete particle swarm optimization algorithm for the no-wait flowshop scheduling problem with makespan criterion. In: Proceedings of the 24th Annual Workshop of the UK Planning and Scheduling Special Interest Group (UK PlanSIG 2005), London, UK, December 2005, pp 31–41

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

    Article  MathSciNet  MATH  Google Scholar 

  44. Pan QK, Wang L, Zhao BH (2008) An improved iterated greedy algorithm for the no-wait flow shop scheduling problem with makespan criterion. Int J Adv Manuf Technol 38(7–8):778–786

    Article  Google Scholar 

  45. Rajendran C (1994) A no-wait flow shop scheduling heuristic to minimize makespan. J Oper Res Soc 45:472–478

    Article  MATH  Google Scholar 

  46. Reddi SS, Ramamoorthy CV (1972) On the flow-shop sequencing problem with no wait in process. Oper Res Q 23(3):323–331

  47. Samarghandi H, ElMekkawy TY (2012) A meta-heuristic approach for solving the no-wait flow-shop problem. Int J Prod Res 50(24):7313–7326

    Article  Google Scholar 

  48. Sánchez-Oro J, Mladenović N, Duarte A (2014) General variable neighborhood search for computing graph separators. Optim Lett 1–21. doi:10.1007/s11590-014-0793-z

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

    Article  MathSciNet  MATH  Google Scholar 

  50. Sule DR (2001) Logistics of facility location and allocation. Marcel Dekker Inc, New York, NY

    Book  Google Scholar 

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

    Article  MATH  Google Scholar 

  52. Tasgetiren MF, Buyukdagli O, Pan QK, Suganthan PN (2013) A general variable neighborhood search algorithm for the no-idle permutation flowshop scheduling problem. In: Swarm, evolutionary, and memetic computing. Springer International Publishing, pp. 24–34

  53. Todosijević R, Mjirda A, Mladenović M, Hanafi S, Gendron B (2014) A general variable neighborhood search variants for the travelling salesman problem with draft limits. Optim Lett 1–10. doi:10.1007/s11590-014-0788-9

  54. Tseng LY, Lin YT (2010) A hybrid genetic algorithm for no-wait flowshop scheduling problem. Int J Prod Econ 128(1):144–152

    Article  Google Scholar 

  55. Wang SY, Wang L, Liu M, Xu Y (2013) An effective estimation of distribution algorithm for solving the distributed permutation flow-shop scheduling problem. Int J Product Econ 145(1):387–396

    Article  Google Scholar 

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

    Article  MATH  Google Scholar 

  57. Xu Y, Wang L, Wang S, Liu M (2014) An effective hybrid immune algorithm for solving the distributed permutation flow-shop scheduling problem. Eng Optim 46(9):1269–1283

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Electrical Engineering and Computer Science, Case Western Reserve University, 10900 Euclid Ave., Cleveland, OH, 44106, USA

    M. Komaki & B. Malakooti

Authors
  1. M. Komaki
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. B. Malakooti
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to M. Komaki.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Komaki, M., Malakooti, B. General variable neighborhood search algorithm to minimize makespan of the distributed no-wait flow shop scheduling problem. Prod. Eng. Res. Devel. 11, 315–329 (2017). https://doi.org/10.1007/s11740-017-0716-9

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11740-017-0716-9

Keywords

Search

Navigation