Skip to main content
Top
Published in: Soft Computing 12/2017

24-05-2016 | Foundations

Two new meta-heuristics for no-wait flexible flow shop scheduling problem with capacitated machines, mixed make-to-order and make-to-stock policy

Authors: Sana Abdollahpour, Javad Rezaian

Published in: Soft Computing | Issue 12/2017

Log in

Activate our intelligent search to find suitable subject content or patents.

search-config
loading …

Abstract

This paper focuses on solving no-wait flexible flow shop scheduling problem with capacitated machines and mixed make-to-order and make-to-stock production management policy restrictions. The considered objective function is minimization of the sum of tardiness cost, weighted earliness cost, weighted rejection cost and weighted incomplete cost. Considering the literature, this problem is known as NP-hard. Hence, the cloudy-based simulated annealing (CSA) and artificial immune system are developed to solve the considered problem. Due to the fact that the parameters may influence the meta-heuristic algorithms, the parameters tuning is performed by Taguchi method. Finally, the performances of algorithms are evaluated by solving the randomly generated problems. Computational experiments show that the CSA algorithm obtains higher-quality solutions than another one.

Dont have a licence yet? Then find out more about our products and how to get one now:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

Literature
go back to reference Arabameri S, Salmasi N (2013) Minimization of weighted earliness and tardiness for no-wait sequence-dependent setup times flowshop scheduling problem. Comput Ind Eng 64:902–916CrossRef Arabameri S, Salmasi N (2013) Minimization of weighted earliness and tardiness for no-wait sequence-dependent setup times flowshop scheduling problem. Comput Ind Eng 64:902–916CrossRef
go back to reference Cheng T, Li Z, Deng M, Xu Z (2005) Representing indeterminate spatial objects by cloud theory. In: Proceedings of the 4th international symposium on spatial data quality, pp 70–77 Cheng T, Li Z, Deng M, Xu Z (2005) Representing indeterminate spatial objects by cloud theory. In: Proceedings of the 4th international symposium on spatial data quality, pp 70–77
go back to reference Cheng T, Zhilin L, Deren L, Deyi L (2006) An integrated cloud model for measurement errors and fuzziness. In: Proceedings of the 12th international symposium on spatial data handling, pp 699–718 Cheng T, Zhilin L, Deren L, Deyi L (2006) An integrated cloud model for measurement errors and fuzziness. In: Proceedings of the 12th international symposium on spatial data handling, pp 699–718
go back to reference Coello Coello CA, Cruz Cort’es N (2005) Solving multi objective optimization problems using an artificial immune system. Genet Program Evol Mach 6:163–190CrossRef Coello Coello CA, Cruz Cort’es N (2005) Solving multi objective optimization problems using an artificial immune system. Genet Program Evol Mach 6:163–190CrossRef
go back to reference Davendra D, Zelinka I, Bialic-Davendra M, Senkerik R, Jasek R (2013) Discrete self-organising migrating algorithm for flow-shop scheduling with no-wait makespan. Math Comput Model 57:100–110MathSciNetCrossRefMATH Davendra D, Zelinka I, Bialic-Davendra M, Senkerik R, Jasek R (2013) Discrete self-organising migrating algorithm for flow-shop scheduling with no-wait makespan. Math Comput Model 57:100–110MathSciNetCrossRefMATH
go back to reference Deyi L, Haijun M, Xuemei S (1995) Membership clouds and membership cloud generators. J Comput Res Dev 32(6):15–20 Deyi L, Haijun M, Xuemei S (1995) Membership clouds and membership cloud generators. J Comput Res Dev 32(6):15–20
go back to reference Deyi L, Cheung D, Shi XM, Ng V (1998) Uncertainty reasoning based on cloud models in controllers. Comput Math Appl 35(3):99–123CrossRefMATH Deyi L, Cheung D, Shi XM, Ng V (1998) Uncertainty reasoning based on cloud models in controllers. Comput Math Appl 35(3):99–123CrossRefMATH
go back to reference Deyi L, Di K, Deren L (2000) Knowledge representation and uncertainty reasoning in GIS based on cloud theory. In: Proceedings of the 9th international symposium on spatial data handling, vol 3a, pp 3–14 Deyi L, Di K, Deren L (2000) Knowledge representation and uncertainty reasoning in GIS based on cloud theory. In: Proceedings of the 9th international symposium on spatial data handling, vol 3a, pp 3–14
go back to reference Deyi L, Yi D (2005) Artificial intelligence with uncertainty. Chapman & Hall, LondonMATH Deyi L, Yi D (2005) Artificial intelligence with uncertainty. Chapman & Hall, LondonMATH
go back to reference Deyi L, Yi D (2005) Artificial intelligence with uncertainty. Chapman & Hall, LondonMATH Deyi L, Yi D (2005) Artificial intelligence with uncertainty. Chapman & Hall, LondonMATH
go back to reference Di K, Deyi L, Deren L (1999) Cloud theory and its applications in spatial data mining knowledge discovery. J Image Graph 4A(11):930–935 Di K, Deyi L, Deren L (1999) Cloud theory and its applications in spatial data mining knowledge discovery. J Image Graph 4A(11):930–935
go back to reference Eivazy H, Rabbani M, Ebadian M (2009) A developed production control and scheduling model in the semiconductor manufacturing systems with hybrid make-to-stock/make-to-order products. Int J Adv Manuf Technol 45:968–986. doi:10.1007/s00170-009-2028-5 CrossRef Eivazy H, Rabbani M, Ebadian M (2009) A developed production control and scheduling model in the semiconductor manufacturing systems with hybrid make-to-stock/make-to-order products. Int J Adv Manuf Technol 45:968–986. doi:10.​1007/​s00170-009-2028-5 CrossRef
go back to reference Fang W, Yanpeng L, Xiang L (2007) A new performance evaluation method for automatic target recognition based on forward cloud. In: Proceedings of the Asia Simulation Conference, pp 337–345 Fang W, Yanpeng L, Xiang L (2007) A new performance evaluation method for automatic target recognition based on forward cloud. In: Proceedings of the Asia Simulation Conference, pp 337–345
go back to reference Feizhou Z, Yuezu F, Chengzhi S, Deyi L (1999) Intelligent control based membership cloud generators. Acta Aeronaut Astronaut Sin 20(1):89–92 Feizhou Z, Yuezu F, Chengzhi S, Deyi L (1999) Intelligent control based membership cloud generators. Acta Aeronaut Astronaut Sin 20(1):89–92
go back to reference Framinan JM, Nagano MS, Moccellin JV (2010) An efficient heuristic for total flow time minimisation in no-wait flow shops. Int J Adv Manuf Technol 46:1049–1057CrossRef Framinan JM, Nagano MS, Moccellin JV (2010) An efficient heuristic for total flow time minimisation in no-wait flow shops. Int J Adv Manuf Technol 46:1049–1057CrossRef
go back to reference Framinan JM, Nagano MS (2008) Evaluating the performance for makespan minimisation in no-wait flow shop sequencing. J Mater Process Technol 197:1–9CrossRef Framinan JM, Nagano MS (2008) Evaluating the performance for makespan minimisation in no-wait flow shop sequencing. J Mater Process Technol 197:1–9CrossRef
go back to reference Gangadharan R, Rajendran C (1993) Heuristic algorithms for scheduling in the no-wait flow shop. Int J Prod Econ 32:285–290CrossRef Gangadharan R, Rajendran C (1993) Heuristic algorithms for scheduling in the no-wait flow shop. Int J Prod Econ 32:285–290CrossRef
go back to reference Hadj Yousssef K, Van Delft C, Dallery Y (2004) Efficient scheduling rules in a combined make-to stock and make-to order manufacturing system. Ann Oper Res 126:103–134MathSciNetCrossRefMATH Hadj Yousssef K, Van Delft C, Dallery Y (2004) Efficient scheduling rules in a combined make-to stock and make-to order manufacturing system. Ann Oper Res 126:103–134MathSciNetCrossRefMATH
go back to reference Haijun W, Yu D (2007) Spatial clustering method based on cloud model. Proceedings of the fourth international conference on fuzzy systems and knowledge discovery, vol 7, pp 272–276 Haijun W, Yu D (2007) Spatial clustering method based on cloud model. Proceedings of the fourth international conference on fuzzy systems and knowledge discovery, vol 7, pp 272–276
go back to reference Hall NG, Sriskandarajah C (1996) A survey of machine scheduling problems with blocking and no-wait in process. Oper Res 44:510–525MathSciNetCrossRefMATH Hall NG, Sriskandarajah C (1996) A survey of machine scheduling problems with blocking and no-wait in process. Oper Res 44:510–525MathSciNetCrossRefMATH
go back to reference Javadi B, Saidi-Mehrabad M, Haji A, Mahdavi I, Jolai F, Mahvadi-Amiri N (2008) No-wait flow shop scheduling using fuzzy multi-objective linear programming. J Franklin Inst 345:452–467CrossRefMATH Javadi B, Saidi-Mehrabad M, Haji A, Mahdavi I, Jolai F, Mahvadi-Amiri N (2008) No-wait flow shop scheduling using fuzzy multi-objective linear programming. J Franklin Inst 345:452–467CrossRefMATH
go back to reference Jolai F, Asefi H, Rabiee M, Ramezani P (2013) Bi-objective simulated annealing approaches for no-wait two-stage flexible flow shop scheduling problem. Sci Iran E 20(3):861–872 Jolai F, Asefi H, Rabiee M, Ramezani P (2013) Bi-objective simulated annealing approaches for no-wait two-stage flexible flow shop scheduling problem. Sci Iran E 20(3):861–872
go back to reference Kaichang D, Deyi L, Deren L (1998) Knowledge representation and discovery in spatial databases based on cloud theory. Int Arch Photogramm Remote Sens 32(3/1):544–551 Kaichang D, Deyi L, Deren L (1998) Knowledge representation and discovery in spatial databases based on cloud theory. Int Arch Photogramm Remote Sens 32(3/1):544–551
go back to reference Khoo LP, Situmdrang TD (2003) Solving the assembly configuration problem for modular products using an immune algorithm approach. Int J Prod Res 41(15):3419–3434CrossRefMATH Khoo LP, Situmdrang TD (2003) Solving the assembly configuration problem for modular products using an immune algorithm approach. Int J Prod Res 41(15):3419–3434CrossRefMATH
go back to reference King JR, Spachis AS (1980) Heuristics for flow shop scheduling. Int J Prod Res 18:343–357 King JR, Spachis AS (1980) Heuristics for flow shop scheduling. Int J Prod Res 18:343–357
go back to reference Laarhoven V, Aarts E (1987) Simulated annealing: theory and applications. Kluwer Academic, Norwell 186ppCrossRefMATH Laarhoven V, Aarts E (1987) Simulated annealing: theory and applications. Kluwer Academic, Norwell 186ppCrossRefMATH
go back to reference Laha D, Sapkal SU (2014) An improved heuristic to minimize total flow time for scheduling in the m-machine no-wait flow shop. Comput Ind Eng 67:36–43CrossRef Laha D, Sapkal SU (2014) An improved heuristic to minimize total flow time for scheduling in the m-machine no-wait flow shop. Comput Ind Eng 67:36–43CrossRef
go back to reference Li X, Yalaoui F, Amodeo L, Chehade H (2012) Metaheuristics and exact methods to solve a multiobjective parallel machines scheduling problem. J Intell Manuf 23(4):1179–1194CrossRef Li X, Yalaoui F, Amodeo L, Chehade H (2012) Metaheuristics and exact methods to solve a multiobjective parallel machines scheduling problem. J Intell Manuf 23(4):1179–1194CrossRef
go back to reference Lin SW, Ying KC (2013) Minimizing makespan in a blocking flow shop using a revised artificial immune system algorithm. Omega 41:383–389CrossRef Lin SW, Ying KC (2013) Minimizing makespan in a blocking flow shop using a revised artificial immune system algorithm. Omega 41:383–389CrossRef
go back to reference Liu Y, Feng Z (2014) Two-machine no-wait flowshop scheduling with learning effect and convex resource-dependent processing times. Comput Ind Eng 75:170–175CrossRef Liu Y, Feng Z (2014) Two-machine no-wait flowshop scheduling with learning effect and convex resource-dependent processing times. Comput Ind Eng 75:170–175CrossRef
go back to reference Lv P, Yuan L, Zhang J (2009) Cloud theory-based simulated annealing algorithm and application. Eng Appl Artif Intell 22:742–749CrossRef Lv P, Yuan L, Zhang J (2009) Cloud theory-based simulated annealing algorithm and application. Eng Appl Artif Intell 22:742–749CrossRef
go back to reference Nunes de castro L, Von Zuben FJ (1999) Artificial immune systems. Part I: Basic theory and applications, Technical Report TR-DCA 01/99. FEEC/UNICAMP, Brazil Nunes de castro L, Von Zuben FJ (1999) Artificial immune systems. Part I: Basic theory and applications, Technical Report TR-DCA 01/99. FEEC/UNICAMP, Brazil
go back to reference Pan QK, Wang L, Qian B (2009) A novel differential evolution algorithm for bi-criteria no-wait flow shop scheduling problems. Comput Oper Res 36:2498–2511MathSciNetCrossRefMATH Pan QK, Wang L, Qian B (2009) A novel differential evolution algorithm for bi-criteria no-wait flow shop scheduling problems. Comput Oper Res 36:2498–2511MathSciNetCrossRefMATH
go back to reference Pang KW (2013) A genetic algorithm based heuristic for two machine no-wait flow shop scheduling problems with class setup times that minimizes maximum lateness. Int J Prod Econ 141:127–136CrossRef Pang KW (2013) A genetic algorithm based heuristic for two machine no-wait flow shop scheduling problems with class setup times that minimizes maximum lateness. Int J Prod Econ 141:127–136CrossRef
go back to reference Qian B, Wang L, Hu R, Huang DX, Wang X (2009) A DE-based approach to no-wait flow-shop scheduling. Comput Ind Eng 57:787–805CrossRef Qian B, Wang L, Hu R, Huang DX, Wang X (2009) A DE-based approach to no-wait flow-shop scheduling. Comput Ind Eng 57:787–805CrossRef
go back to reference Rajendran C (1994) A no-wait flow shop scheduling heuristic to minimize makespan. J Oper Res Soc 45:472–478CrossRefMATH Rajendran C (1994) A no-wait flow shop scheduling heuristic to minimize makespan. J Oper Res Soc 45:472–478CrossRefMATH
go back to reference Ramezani P, Rabiee M, Jolai F (2013) No-wait flexible flowshop with uniform parallel machines and sequence-dependent setup times: a hybrid meta-heuristic approach. J Intell Manuf. doi:10.1007/s10845-013-0830-2 Ramezani P, Rabiee M, Jolai F (2013) No-wait flexible flowshop with uniform parallel machines and sequence-dependent setup times: a hybrid meta-heuristic approach. J Intell Manuf. doi:10.​1007/​s10845-013-0830-2
go back to reference Reddi SS, Rama-moorthy CV (1972) On the flow shop sequencing problems with no-wait intermediate queues. Oper Res Q 23:323–331CrossRef Reddi SS, Rama-moorthy CV (1972) On the flow shop sequencing problems with no-wait intermediate queues. Oper Res Q 23:323–331CrossRef
go back to reference Ruiz R, Allahverdi A (2007) No-wait flow shop with separate setup times to minimize maximum lateness. Int. J. Adv. Manuf. Technol. 35:551–565 Ruiz R, Allahverdi A (2007) No-wait flow shop with separate setup times to minimize maximum lateness. Int. J. Adv. Manuf. Technol. 35:551–565
go back to reference Seido Nagano M, Hissashi Miyata H, Castro Araújo D (2015) A constructive heuristic for total flowtime minimization in a no-wait flowshop with sequence-dependent setup times. J Manuf Syst 36:224–230CrossRef Seido Nagano M, Hissashi Miyata H, Castro Araújo D (2015) A constructive heuristic for total flowtime minimization in a no-wait flowshop with sequence-dependent setup times. J Manuf Syst 36:224–230CrossRef
go back to reference Seido Nagano M, Almeida da Silva A (2012) A new evolutionary clustering search for a no-wait flow shop problem with set-uptimes. Eng Appl Artif Intell 25:1114–1120CrossRef Seido Nagano M, Almeida da Silva A (2012) A new evolutionary clustering search for a no-wait flow shop problem with set-uptimes. Eng Appl Artif Intell 25:1114–1120CrossRef
go back to reference Shabtay D, Arviv K, Stern H, Edan Y (2014) A combined robot selection and scheduling problem for flow-shops with no-wait restrictions. Omega 43:96–107CrossRef Shabtay D, Arviv K, Stern H, Edan Y (2014) A combined robot selection and scheduling problem for flow-shops with no-wait restrictions. Omega 43:96–107CrossRef
go back to reference Shuliang W, Deren L, Wenzhong S, Deyi L, Xinzhou W (2003) Cloud model-based spatial data mining. Geogr Inf Sci 9(2):67–78 Shuliang W, Deren L, Wenzhong S, Deyi L, Xinzhou W (2003) Cloud model-based spatial data mining. Geogr Inf Sci 9(2):67–78
go back to reference Solimanpur M, Vrat P, Shankar R (2004) A neuro-tabu search heuristic for flow shop scheduling problem. Comput Oper Res 31:2151–2164CrossRefMATH Solimanpur M, Vrat P, Shankar R (2004) A neuro-tabu search heuristic for flow shop scheduling problem. Comput Oper Res 31:2151–2164CrossRefMATH
go back to reference Tavakkoli-Moghaddam R, Rahimi-Vahed AR, Mirzaei AH (2008) Solving a multi-objective no-wait flow shop scheduling problem with an immune algorithm. Int J Adv Manuf Technol 36:969–981CrossRef Tavakkoli-Moghaddam R, Rahimi-Vahed AR, Mirzaei AH (2008) Solving a multi-objective no-wait flow shop scheduling problem with an immune algorithm. Int J Adv Manuf Technol 36:969–981CrossRef
go back to reference Torabzadeh E, Zandieh M (2010) Cloud theory-based simulated annealing approach for scheduling in the two-stage assembly flowshop. Adv Eng Softw 41:1238–1243CrossRefMATH Torabzadeh E, Zandieh M (2010) Cloud theory-based simulated annealing approach for scheduling in the two-stage assembly flowshop. Adv Eng Softw 41:1238–1243CrossRefMATH
go back to reference Tseng LY, Lin YT (2011) A hybrid genetic algorithm for no-wait flow shop scheduling problem. Eur J Oper Res 210:39–47CrossRef Tseng LY, Lin YT (2011) A hybrid genetic algorithm for no-wait flow shop scheduling problem. Eur J Oper Res 210:39–47CrossRef
go back to reference Valente Jorge MS, Alves Rui AFS (2005) An exact approach to early/tardy scheduling with release dates. Comput Oper Res 32:2905–2917MathSciNetCrossRefMATH Valente Jorge MS, Alves Rui AFS (2005) An exact approach to early/tardy scheduling with release dates. Comput Oper Res 32:2905–2917MathSciNetCrossRefMATH
go back to reference Wang C, Li X, Wang Q (2010) Accelerated tabu search for no-wait flowshop scheduling problem with maximum lateness criterion. Eur J Oper Res 206:64–72MathSciNetCrossRefMATH Wang C, Li X, Wang Q (2010) Accelerated tabu search for no-wait flowshop scheduling problem with maximum lateness criterion. Eur J Oper Res 206:64–72MathSciNetCrossRefMATH
go back to reference Yingjun W, Zhongying Z (2004) Pattern mining for time series based on cloud theory pan-concept-tree. In: International conference on rough sets and current trends in computing, vol 1, pp 618–623 Yingjun W, Zhongying Z (2004) Pattern mining for time series based on cloud theory pan-concept-tree. In: International conference on rough sets and current trends in computing, vol 1, pp 618–623
go back to reference Yunfang Z, Chaohua D, Weirong C (2005) Adaptive probabilities of crossover and mutation in genetic algorithms based on cloud generators. J Comput Inf Syst 1(4):671–678 Yunfang Z, Chaohua D, Weirong C (2005) Adaptive probabilities of crossover and mutation in genetic algorithms based on cloud generators. J Comput Inf Syst 1(4):671–678
go back to reference Zaerpour N, Rabbani M, Gharehgozli AH, Tavakkoli-Moghaddam R (2009) A comprehensive decision making structure for partitioning of make-to-order, make-to-stock and hybrid products. Soft Comput 13:1035–1054. doi:10.1007/s00500-008-0377-x CrossRefMATH Zaerpour N, Rabbani M, Gharehgozli AH, Tavakkoli-Moghaddam R (2009) A comprehensive decision making structure for partitioning of make-to-order, make-to-stock and hybrid products. Soft Comput 13:1035–1054. doi:10.​1007/​s00500-008-0377-x CrossRefMATH
go back to reference Zandieh M, Fatemi GHomi SMT, Moattar Husseini SM (2006) An immune algorithm approach to hybrid flow shops scheduling with sequence-dependent setup times. Appl Math Comput 180(1):111–127MathSciNetCrossRefMATH Zandieh M, Fatemi GHomi SMT, Moattar Husseini SM (2006) An immune algorithm approach to hybrid flow shops scheduling with sequence-dependent setup times. Appl Math Comput 180(1):111–127MathSciNetCrossRefMATH
Metadata
Title
Two new meta-heuristics for no-wait flexible flow shop scheduling problem with capacitated machines, mixed make-to-order and make-to-stock policy
Authors
Sana Abdollahpour
Javad Rezaian
Publication date
24-05-2016
Publisher
Springer Berlin Heidelberg
Published in
Soft Computing / Issue 12/2017
Print ISSN: 1432-7643
Electronic ISSN: 1433-7479
DOI
https://doi.org/10.1007/s00500-016-2185-z

Other articles of this Issue 12/2017

Soft Computing 12/2017 Go to the issue

Premium Partner