Skip to main content
SpringerLink
Log in

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

  • Foundations
  • Published:
Soft Computing Aims and scope Submit manuscript

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.

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

Access this article

Log in via an institution

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
Fig. 7
Fig. 8
Fig. 9
Fig. 10
Fig. 11
Fig. 12
Fig. 13
Fig. 14
Fig. 15
Fig. 16

Similar content being viewed by others

References

  • Adan IJBF, Wall J (1998) Combining make to order and make to stock. OR Spektrum 20:73–81. doi:10.1007/BF01539854

    Article  MATH  Google Scholar 

  • 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–916

    Article  Google Scholar 

  • Ch YK, Lee ZJ, Lu CC, Lin SW (2012) Metaheuristics for scheduling a no-wait flowshop manufacturing cell with sequence-dependent family setups. Int J Adv Manuf Technol 58:671–682. doi:10.1007/s00170-011-3419-y

    Article  Google Scholar 

  • 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, 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

  • Coello Coello CA, Cruz Cort’es N (2005) Solving multi objective optimization problems using an artificial immune system. Genet Program Evol Mach 6:163–190

    Article  Google Scholar 

  • 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–110

    Article  MathSciNet  MATH  Google Scholar 

  • Deyi L, Haijun M, Xuemei S (1995) Membership clouds and membership cloud generators. J Comput Res Dev 32(6):15–20

    Google Scholar 

  • Deyi L, Cheung D, Shi XM, Ng V (1998) Uncertainty reasoning based on cloud models in controllers. Comput Math Appl 35(3):99–123

    Article  MATH  Google Scholar 

  • 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, Yi D (2005) Artificial intelligence with uncertainty. Chapman & Hall, London

    MATH  Google Scholar 

  • Deyi L, Yi D (2005) Artificial intelligence with uncertainty. Chapman & Hall, London

    MATH  Google Scholar 

  • 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

    Google Scholar 

  • 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

    Article  Google Scholar 

  • 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

  • Federgruen A, Katalan Z (1999) The impact of adding a make-to-order item to a make-to-order production system. Manage Sci 45(7):980–994. doi:10.1287/mnsc.45.7.980

    Article  MATH  Google Scholar 

  • Feizhou Z, Yuezu F, Chengzhi S, Deyi L (1999) Intelligent control based membership cloud generators. Acta Aeronaut Astronaut Sin 20(1):89–92

    Google Scholar 

  • 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–1057

    Article  Google Scholar 

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

    Article  Google Scholar 

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

    Article  Google Scholar 

  • 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–134

    Article  MathSciNet  MATH  Google Scholar 

  • 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

  • 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 

  • 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–467

    Article  MATH  Google Scholar 

  • Jolai F, Sheikh S, Rabbani M, Karimi B (2009) A genetic algorithm for solving no-wait flexible flow lines with due window and job rejection. Int J Adv Manuf Technol 42:523–532. doi:10.1007/s00170-008-1618-y

    Article  Google Scholar 

  • 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

    Google Scholar 

  • 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

    Google Scholar 

  • 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–3434

    Article  MATH  Google Scholar 

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

    Google Scholar 

  • Laarhoven V, Aarts E (1987) Simulated annealing: theory and applications. Kluwer Academic, Norwell 186pp

    Book  MATH  Google Scholar 

  • 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–43

    Article  Google Scholar 

  • 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–1194

    Article  Google Scholar 

  • Lin SW, Ying KC (2013) Minimizing makespan in a blocking flow shop using a revised artificial immune system algorithm. Omega 41:383–389

    Article  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  • 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–175

    Article  Google Scholar 

  • Lv P, Yuan L, Zhang J (2009) Cloud theory-based simulated annealing algorithm and application. Eng Appl Artif Intell 22:742–749

    Article  Google Scholar 

  • 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

  • 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–2511

    Article  MathSciNet  MATH  Google Scholar 

  • 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–136

    Article  Google Scholar 

  • 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–805

    Article  Google Scholar 

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

    Article  MATH  Google Scholar 

  • 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

  • Reddi SS, Rama-moorthy CV (1972) On the flow shop sequencing problems with no-wait intermediate queues. Oper Res Q 23:323–331

    Article  Google Scholar 

  • 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

  • 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–230

    Article  Google Scholar 

  • 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–1120

    Article  Google Scholar 

  • 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–107

    Article  Google Scholar 

  • Shuliang W, Deren L, Wenzhong S, Deyi L, Xinzhou W (2003) Cloud model-based spatial data mining. Geogr Inf Sci 9(2):67–78

    Google Scholar 

  • Solimanpur M, Vrat P, Shankar R (2004) A neuro-tabu search heuristic for flow shop scheduling problem. Comput Oper Res 31:2151–2164

    Article  MATH  Google Scholar 

  • Soman CA, Van Donk DP, Gaalman G (2004) Combined make-to-order and make-to-stock in a food production system. Int J Prod Econ 90(2):223–235. doi:10.1016/S0925-5273(02)00376-6

    Article  MATH  Google Scholar 

  • 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–981

    Article  Google Scholar 

  • Torabzadeh E, Zandieh M (2010) Cloud theory-based simulated annealing approach for scheduling in the two-stage assembly flowshop. Adv Eng Softw 41:1238–1243

    Article  MATH  Google Scholar 

  • Tseng LY, Lin YT (2011) A hybrid genetic algorithm for no-wait flow shop scheduling problem. Eur J Oper Res 210:39–47

    Article  Google Scholar 

  • Valente Jorge MS, Alves Rui AFS (2005) An exact approach to early/tardy scheduling with release dates. Comput Oper Res 32:2905–2917

    Article  MathSciNet  MATH  Google Scholar 

  • 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–72

    Article  MathSciNet  MATH  Google Scholar 

  • Wang S, Liu M (2013) A genetic algorithm for two-stage no-wait hybrid flow shop. Comput Oper Res 40:1064–1072

    Article  MathSciNet  MATH  Google Scholar 

  • 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

  • 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

    Google Scholar 

  • 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

    Article  MATH  Google Scholar 

  • 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–127

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of industrial engineering, Mazandaran University of Science and Technology, Babol, Iran

    Sana Abdollahpour & Javad Rezaian

Authors
  1. Sana Abdollahpour
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Javad Rezaian
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Javad Rezaian.

Ethics declarations

Conflict of interest

All authors declare that they have no conflicts of interest.

Additional information

Communicated by A. Di Nola.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Abdollahpour, S., Rezaian, J. Two new meta-heuristics for no-wait flexible flow shop scheduling problem with capacitated machines, mixed make-to-order and make-to-stock policy. Soft Comput 21, 3147–3165 (2017). https://doi.org/10.1007/s00500-016-2185-z

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00500-016-2185-z

Keywords

Search

Navigation