{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,26]],"date-time":"2026-01-26T15:47:09Z","timestamp":1769442429531,"version":"3.49.0"},"reference-count":74,"publisher":"Springer Science and Business Media LLC","issue":"11","license":[{"start":{"date-parts":[[2019,10,8]],"date-time":"2019-10-08T00:00:00Z","timestamp":1570492800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2019,10,8]],"date-time":"2019-10-08T00:00:00Z","timestamp":1570492800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Soft Comput"],"published-print":{"date-parts":[[2020,6]]},"DOI":"10.1007\/s00500-019-04407-3","type":"journal-article","created":{"date-parts":[[2019,10,8]],"date-time":"2019-10-08T19:03:06Z","timestamp":1570561386000},"page":"8377-8401","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":12,"title":["Scheduling two-stage assembly flow shop with random machines breakdowns: integrated new self-adapted differential evolutionary and simulation approach"],"prefix":"10.1007","volume":"24","author":[{"given":"Hany","family":"Seidgar","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3053-4399","authenticated-orcid":false,"given":"Hamed","family":"Fazlollahtabar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mostafa","family":"Zandieh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,10,8]]},"reference":[{"issue":"6","key":"4407_CR1","doi-asserted-by":"crossref","first-page":"1680","DOI":"10.1080\/00207543.2014.952795","volume":"53","author":"M Abedi","year":"2015","unstructured":"Abedi M, Seidgar H, Fazlollahtabar H, Bijani R (2015) Bi-objective optimization for scheduling the identical parallel batch-processing machines with arbitrary job sizes, unequal job release times and capacity limits. Int J Prod Res 53(6):1680\u20131711","journal-title":"Int J Prod Res"},{"issue":"4","key":"4407_CR2","first-page":"207","volume":"26","author":"FS Al-Anzi","year":"2004","unstructured":"Al-Anzi FS, Allahverdi A (2004) Hybrid simulated annealing heuristic for multimedia object requests scheduling problem. Int J Comput Appl 26(4):207\u2013211","journal-title":"Int J Comput Appl"},{"key":"4407_CR3","doi-asserted-by":"crossref","first-page":"80","DOI":"10.1016\/j.ejor.2006.09.011","volume":"182","author":"FS Al-Anzi","year":"2007","unstructured":"Al-Anzi FS, Allahverdi A (2007) A self-adaptive differential evolution heuristic for two- stage assembly scheduling problem to minimize maximum lateness with setup times. Eur J Oper Res 182:80\u201394","journal-title":"Eur J Oper Res"},{"key":"4407_CR4","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1016\/j.ijpe.2011.04.020","volume":"132","author":"N AL-Hinai","year":"2011","unstructured":"AL-Hinai N, Elmekkawy TY (2011) Robust and stable flexible job shop scheduling with random machine breakdowns using a hybrid genetic algorithm. Int J Prod Econ 132:279\u2013291","journal-title":"Int J Prod Econ"},{"key":"4407_CR5","doi-asserted-by":"crossref","first-page":"896","DOI":"10.1057\/jors.1995.122","volume":"46","author":"A Allahverdi","year":"1995","unstructured":"Allahverdi A (1995) Two-stage production scheduling with separated set-up times and stochastic breakdown. J Oper Res Soc 46:896\u2013904","journal-title":"J Oper Res Soc"},{"key":"4407_CR6","doi-asserted-by":"crossref","first-page":"909","DOI":"10.1016\/0305-0548(96)00012-3","volume":"23","author":"A Allahverdi","year":"1996","unstructured":"Allahverdi A (1996) Two-machine proportionate flow shop scheduling with breakdowns to minimize maximum lateness. Comput Oper Res 23:909\u2013916","journal-title":"Comput Oper Res"},{"issue":"22","key":"4407_CR7","doi-asserted-by":"crossref","first-page":"4713","DOI":"10.1080\/00207540600621029","volume":"44","author":"A Allahverdi","year":"2006","unstructured":"Allahverdi A, Al-Anzi FS (2006) Evolutionary heuristics and an algorithm for the two-stage assembly scheduling problem to minimise makespan with setup times. Int J Prod Res 44(22):4713\u20134735","journal-title":"Int J Prod Res"},{"issue":"1","key":"4407_CR8","first-page":"166","volume":"37","author":"A Allahverdi","year":"2007","unstructured":"Allahverdi A, Al-Anzi FS (2007) The two-stage assembly flowshop scheduling problem with bicriteria of makespan and mean completion time. Int J Adv Manuf Technol 37(1):166\u2013177","journal-title":"Int J Adv Manuf Technol"},{"issue":"10","key":"4407_CR9","doi-asserted-by":"crossref","first-page":"2740","DOI":"10.1016\/j.cor.2008.12.001","volume":"36","author":"A Allahverdi","year":"2009","unstructured":"Allahverdi A, Al-Anzi FS (2009) The two-stage assembly flowshop scheduling problem to minimise total completion time with setup times. Comput Oper Res 36(10):2740\u20132747","journal-title":"Comput Oper Res"},{"key":"4407_CR10","doi-asserted-by":"crossref","first-page":"317","DOI":"10.1016\/S0969-6016(97)00042-7","volume":"5","author":"A Allahverdi","year":"1998","unstructured":"Allahverdi A, Mittenthal J (1998) Dual criteria scheduling on a two-machine flow shop subject to random breakdowns. Int Transl Oper Res 5:317\u2013324","journal-title":"Int Transl Oper Res"},{"issue":"4","key":"4407_CR11","doi-asserted-by":"crossref","first-page":"431","DOI":"10.1016\/j.cie.2004.09.002","volume":"47","author":"H Allaoui","year":"2004","unstructured":"Allaoui H, Artiba A (2004) Integrating simulation and optimization to schedule a hybrid flow shop with maintenance constraints. Comput Ind Eng 47(4):431\u2013450","journal-title":"Comput Ind Eng"},{"key":"4407_CR12","first-page":"4661","volume":"4425083","author":"E Atashpaz-Gargari","year":"2008","unstructured":"Atashpaz-Gargari E, Lucas C (2008) Imperialist competitive algorithm: an algorithm for optimisation inspired by imperialistic competition. IEEE Congr Evol Comput (CEC 2007) 4425083:4661\u20134667","journal-title":"IEEE Congr Evol Comput (CEC 2007)"},{"issue":"5","key":"4407_CR14","doi-asserted-by":"crossref","first-page":"1415","DOI":"10.1080\/00207540802556817","volume":"48","author":"J Behnamian","year":"2010","unstructured":"Behnamian J, Fatemi Ghomi SMT, Zandieh M (2010) Development of a hybrid metaheuristic to minimise earliness and tardiness in a hybrid flowshop with sequence-dependent setup times. Int J Prod Res 48(5):1415\u20131438","journal-title":"Int J Prod Res"},{"key":"4407_CR15","doi-asserted-by":"crossref","first-page":"389","DOI":"10.1007\/s10845-008-0113-5","volume":"20","author":"A Berrichi","year":"2008","unstructured":"Berrichi A, Amodeo L, Yalaoui F, Chatelet E, Mezghiche M (2008) Bi-objective optimization algorithms for joint production and maintenance scheduling: application to the parallel machine problem\u2019. J Intell Manuf 20:389\u2013400","journal-title":"J Intell Manuf"},{"key":"4407_CR16","volume-title":"Neural network fundamentals with graph, algorithms, and application","author":"NK Bose","year":"1996","unstructured":"Bose NK, Liang P (1996) Neural network fundamentals with graph, algorithms, and application. Tata McGraw Hill, New Delhi"},{"issue":"2","key":"4407_CR17","doi-asserted-by":"crossref","first-page":"230","DOI":"10.1016\/S0377-2217(01)00355-1","volume":"139","author":"PI Cowling","year":"2002","unstructured":"Cowling PI, Johansson M (2002) Using real-time information for effective dynamic scheduling. Eur J Oper Res 139(2):230\u2013244","journal-title":"Eur J Oper Res"},{"key":"4407_CR18","doi-asserted-by":"crossref","first-page":"2653","DOI":"10.1016\/j.cor.2008.11.010","volume":"36","author":"N Damak","year":"2009","unstructured":"Damak N, Jarboui B, Siarry P, Loukil T (2009) Differential evolution for solving multi-mode resource-constrained project scheduling problems. Comput Oper Res 36:2653\u20132659","journal-title":"Comput Oper Res"},{"key":"4407_CR19","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1016\/j.swevo.2016.06.002","volume":"32","author":"J Deng","year":"2017","unstructured":"Deng J, Wang L (2017) A competitive memetic algorithm for multi-objective distributed permutation flow shop scheduling problem. Swarm Evol Comput 32:121\u2013131","journal-title":"Swarm Evol Comput"},{"key":"4407_CR20","volume-title":"Artificial intelligence with uncertainty","author":"L Deyi","year":"2005","unstructured":"Deyi L, Yi D (2005) Artificial intelligence with uncertainty. Chapman and Hall, London"},{"issue":"11","key":"4407_CR21","first-page":"930","volume":"4","author":"K Di","year":"1999","unstructured":"Di K, Deyi L, Deren L (1999) Cloud theory and its applications in spatial data mining knowledge discovery. J Image Gr 4(11):930\u2013935","journal-title":"J Image Gr"},{"issue":"10","key":"4407_CR22","doi-asserted-by":"crossref","first-page":"2681","DOI":"10.1080\/00207543.2011.579637","volume":"50","author":"Y-H Dong","year":"2012","unstructured":"Dong Y-H, Jang J (2012) Production rescheduling for machine breakdown at a job shop. Int J Prod Res 50(10):2681\u20132691","journal-title":"Int J Prod Res"},{"key":"4407_CR23","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1016\/j.cor.2017.07.012","volume":"88","author":"JM Framinan","year":"2017","unstructured":"Framinan JM, Gonzalez PP (2017) The 2-stage assembly flowshop scheduling problem with total completion time: Efficient constructive heuristic and metaheuristic. Comput Oper Res 88:237\u2013246","journal-title":"Comput Oper Res"},{"key":"4407_CR24","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1007\/s00170-008-1577-3","volume":"42","author":"M Gholami","year":"2009","unstructured":"Gholami M, Zandieh M, Alem-Tabriz A (2009a) Scheduling hybrid flow shop with sequence-dependent setup times and machines with random breakdowns. Int J Manuf Technol 42:189\u2013201","journal-title":"Int J Manuf Technol"},{"key":"4407_CR25","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1007\/s00170-008-1577-3","volume":"42","author":"M Gholami","year":"2009","unstructured":"Gholami M, Zandieh M, Alem-Tabriz A (2009b) Scheduling hybrid flow shop with sequence-dependent setup times and machines with random breakdowns. Int J Manuf Technol 42:189\u2013201","journal-title":"Int J Manuf Technol"},{"key":"4407_CR26","volume-title":"Genetic algorithms: Search, optimization & machine learning","author":"DE Goldberg","year":"1989","unstructured":"Goldberg DE (1989) Genetic algorithms: Search, optimization & machine learning, vol 541. Addison-Wesley Inc, Boston"},{"key":"4407_CR27","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1016\/j.simpat.2017.09.001","volume":"79","author":"EM Gonzalez-Neira","year":"2017","unstructured":"Gonzalez-Neira EM, Ferone D, Hatami S, Juan AA (2017) A biased-randomized sim heuristic for the distributed assembly permutation flowshop problem with stochastic processing times. Simul Model Pract Theory 79:23\u201336","journal-title":"Simul Model Pract Theory"},{"key":"4407_CR28","doi-asserted-by":"crossref","first-page":"927","DOI":"10.1016\/j.cor.2009.07.002","volume":"37","author":"J Gu","year":"2010","unstructured":"Gu J, Gu M, Cao C, Gu X (2010) A novel competitive co-evolutionary quantum genetic algorithm for stochastic job shop scheduling problem. Comput Oper Res 37:927\u2013937","journal-title":"Comput Oper Res"},{"issue":"4","key":"4407_CR29","doi-asserted-by":"crossref","first-page":"439","DOI":"10.1051\/ro:1999120","volume":"33","author":"M Haouari","year":"1999","unstructured":"Haouari M, Daouas T (1999) Optimal scheduling of the 3-machine assembly-type flow shop. RAIRO Oper Res 33(4):439\u2013445","journal-title":"RAIRO Oper Res"},{"key":"4407_CR30","doi-asserted-by":"crossref","first-page":"547","DOI":"10.1016\/S0377-2217(96)00312-8","volume":"103","author":"AMA Hariri","year":"1997","unstructured":"Hariri AMA, Potts CN (1997) A branch and bound algorithm for the two-stage assembly scheduling problem. Eur J Oper Res 103:547\u2013556","journal-title":"Eur J Oper Res"},{"key":"4407_CR31","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1016\/S0360-8352(99)00006-6","volume":"36","author":"O Holthaus","year":"1999","unstructured":"Holthaus O (1999) Scheduling in job shops with machine breakdowns: an experimental study. Comput Ind Eng 36:137\u2013162","journal-title":"Comput Ind Eng"},{"key":"4407_CR32","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1016\/j.orl.2005.02.002","volume":"34","author":"N Kasap","year":"2006","unstructured":"Kasap N, Aytug H, Paul A (2006) Minimizing makespan on a single machine subject to random breakdowns. Oper Res Lett 34:29\u201336","journal-title":"Oper Res Lett"},{"key":"4407_CR33","doi-asserted-by":"crossref","first-page":"98","DOI":"10.1016\/j.engappai.2017.05.004","volume":"63","author":"H Kazemi","year":"2017","unstructured":"Kazemi H, Mazdeh Mahdavi M, Rostami M (2017) The two stage assembly flow-shop scheduling problem with batching and delivery. Eng Appl Artif Intell 63:98\u2013107","journal-title":"Eng Appl Artif Intell"},{"key":"4407_CR34","doi-asserted-by":"crossref","first-page":"7911","DOI":"10.1016\/j.eswa.2010.10.066","volume":"38","author":"H Khorshidian","year":"2011","unstructured":"Khorshidian H, Javadian N, Zandieh M, Rezaeian J, Rahmani K (2011) A genetic algorithm for JIT single machine scheduling with preemption and machine idle time. Expert Syst Appl 38:7911\u20137918","journal-title":"Expert Syst Appl"},{"key":"4407_CR35","doi-asserted-by":"crossref","first-page":"671","DOI":"10.1126\/science.220.4598.671","volume":"220","author":"S Kirkpatrick","year":"1983","unstructured":"Kirkpatrick S, Gelatt CD, Vecchi MP (1983) Optimization by simulated annealing. Science 220:671\u2013680","journal-title":"Science"},{"key":"4407_CR36","doi-asserted-by":"crossref","first-page":"158","DOI":"10.1016\/j.cie.2017.01.006","volume":"105","author":"GM Komaki","year":"2017","unstructured":"Komaki GM, Teymourian E, Kayvanfar V, Booyavi Z (2017) Improved discrete cuckoo optimization algorithm for the three-stage assembly flowshop scheduling problem. Comput Ind Eng 105:158\u2013173","journal-title":"Comput Ind Eng"},{"issue":"1","key":"4407_CR37","doi-asserted-by":"crossref","first-page":"66","DOI":"10.1016\/S0377-2217(03)00401-6","volume":"159","author":"ME Kurz","year":"2004","unstructured":"Kurz ME, Askin RG (2004) Scheduling flexible flow lines with sequence-dependent setup times. Eur J Oper Res 159(1):66\u201382","journal-title":"Eur J Oper Res"},{"key":"4407_CR38","doi-asserted-by":"crossref","first-page":"493","DOI":"10.1016\/S0377-2217(00)00322-2","volume":"135","author":"CY Lee","year":"2001","unstructured":"Lee CY, Lin CS (2001) Single-machine scheduling with maintenance and repair rate-modifying activities. Eur J Oper Res 135:493\u2013513","journal-title":"Eur J Oper Res"},{"issue":"5","key":"4407_CR39","doi-asserted-by":"crossref","first-page":"616","DOI":"10.1287\/mnsc.39.5.616","volume":"39","author":"C-Y Lee","year":"1993","unstructured":"Lee C-Y, Cheng TCE, Lin BMT (1993) Minimising the makespan in the 3-machineassembly-type flowshop scheduling problem. Manag Sci 39(5):616\u2013625","journal-title":"Manag Sci"},{"key":"4407_CR40","doi-asserted-by":"crossref","first-page":"1183","DOI":"10.1007\/s00170-010-3151-z","volume":"55","author":"D Lei","year":"2011","unstructured":"Lei D (2011) Scheduling stochastic job shop subject to random breakdown to minimize makespan. Int J Adv Manuf Technol 55:1183\u20131192","journal-title":"Int J Adv Manuf Technol"},{"key":"4407_CR41","doi-asserted-by":"crossref","first-page":"122","DOI":"10.1016\/j.asoc.2017.07.058","volume":"61","author":"D Lei","year":"2017","unstructured":"Lei D, Zheng Y (2017) Hybrid flow shop scheduling with assembly operations and key objectives: a novel neighborhood search. Appl Soft Comput 61:122\u2013128","journal-title":"Appl Soft Comput"},{"issue":"5","key":"4407_CR42","doi-asserted-by":"crossref","first-page":"32","DOI":"10.1080\/07408179408966626","volume":"26","author":"VJ Leon","year":"1994","unstructured":"Leon VJ, Wu SD, Storer RH (1994) Robustness measures and robust scheduling for job shops. IIE Trans 26(5):32\u201343","journal-title":"IIE Trans"},{"key":"4407_CR43","doi-asserted-by":"crossref","first-page":"124","DOI":"10.1016\/j.swevo.2017.04.007","volume":"36","author":"J Lin","year":"2017","unstructured":"Lin J, Wang Z-J, Li X (2017) A backtracking search hyper-heuristic for the distributed assembly flow-shop scheduling problem. Swarm Evol Comput 36:124\u2013135","journal-title":"Swarm Evol Comput"},{"key":"4407_CR44","doi-asserted-by":"crossref","first-page":"645","DOI":"10.1007\/s00170-005-0237-0","volume":"31","author":"L Liu","year":"2007","unstructured":"Liu L, Gu H, Xi Y (2007) Robust and stable scheduling of a single machine with random machine. Int J Adv Manuf Technol 31:645\u2013654","journal-title":"Int J Adv Manuf Technol"},{"issue":"20","key":"4407_CR45","doi-asserted-by":"crossref","first-page":"5906","DOI":"10.1080\/00207543.2011.637092","volume":"50","author":"H Mokhtari","year":"2012","unstructured":"Mokhtari H, Mozdgir A, Abadi IN (2012) A reliability\/availability approach to joint production and maintenance scheduling with multiple preventive maintenance services. Int J Prod Res 50(20):5906\u20135925","journal-title":"Int J Prod Res"},{"issue":"5\u20138","key":"4407_CR46","doi-asserted-by":"crossref","first-page":"829","DOI":"10.1007\/s00170-010-2666-7","volume":"51","author":"E Moradi","year":"2010","unstructured":"Moradi E, Zandieh M (2010) Minimizing the makespan and the system unavailability in parallel machine scheduling problem: a similarity-based genetic algorithm. Int J Adv Manuf Technol 51(5\u20138):829\u2013840","journal-title":"Int J Adv Manuf Technol"},{"key":"4407_CR47","doi-asserted-by":"crossref","first-page":"3625","DOI":"10.1080\/00207543.2012.756151","volume":"51","author":"A Mozdgir","year":"2013","unstructured":"Mozdgir A, Fatemi Ghomi SMT, Joli F, Navaei J (2013) Two-stage assembly flow-shop scheduling problem with non-identical assembly machines considering setup times. Int J Prod Res 51:3625\u20133642","journal-title":"Int J Prod Res"},{"key":"4407_CR48","doi-asserted-by":"crossref","unstructured":"Omran MGH, Salman A, Engelbrecht AP (2005) Self-adaptive differential evolution. In: Proceedings of the international conference on computational intelligence and security (CIS 2005). Xi\u2019an, China, December, pp 192\u2013199","DOI":"10.1007\/11596448_28"},{"issue":"5","key":"4407_CR49","doi-asserted-by":"crossref","first-page":"533","DOI":"10.1057\/palgrave.jors.2600397","volume":"48","author":"C-H Pan","year":"1997","unstructured":"Pan C-H, Chen J-S (1997) Scheduling alternative operations in two-machine flowshops. J Oper Res Soc 48(5):533\u2013540","journal-title":"J Oper Res Soc"},{"key":"4407_CR50","volume-title":"Robust design and analysis for quality engineering","author":"SH Park","year":"1995","unstructured":"Park SH (1995) Robust design and analysis for quality engineering. Chapman and Hall, London"},{"issue":"4\u20135","key":"4407_CR51","first-page":"742","volume":"22","author":"L Pin","year":"2009","unstructured":"Pin L, Lin Y, Jinfang Z (2009) Cloud theory-based simulated annealing algorithm and application. Eng Appl Artif Intell 22(4\u20135):742\u2013749","journal-title":"Eng Appl Artif Intell"},{"issue":"2","key":"4407_CR52","doi-asserted-by":"crossref","first-page":"346","DOI":"10.1287\/opre.43.2.346","volume":"43","author":"CN Potts","year":"1995","unstructured":"Potts CN, Sevast\u2019janov SV, Van Wassenhove LN, Zwaneveld CM (1995) The two-stage assembly scheduling problem: complexity and approximation. Oper Res 43(2):346\u2013355","journal-title":"Oper Res"},{"key":"4407_CR53","doi-asserted-by":"crossref","first-page":"166","DOI":"10.1016\/j.ijpe.2005.05.021","volume":"103","author":"X Qi","year":"2006","unstructured":"Qi X, Bard JF, Yu G (2006) Disruption management for machine scheduling: the case of SPT schedules. Int J Prod Econ 103:166\u2013184","journal-title":"Int J Prod Econ"},{"key":"4407_CR54","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1287\/ijoc.9.3.231","volume":"9","author":"CR Reeves","year":"1997","unstructured":"Reeves CR (1997) Genetic algorithms for the operations researcher. INFORMS J Comput 9:231","journal-title":"INFORMS J Comput"},{"key":"4407_CR55","first-page":"55","volume-title":"Handbook of meta-heuristics","author":"CR Reeves","year":"2003","unstructured":"Reeves CR (2003) Genetic algorithms. In: Glover F, Kochenberger GA (eds) Handbook of meta-heuristics, vol 574. Kluwer Academic Publishers, Dordrecht, p 55"},{"key":"4407_CR56","doi-asserted-by":"crossref","first-page":"3314","DOI":"10.1016\/j.cor.2005.12.007","volume":"34","author":"R Ruiz","year":"2007","unstructured":"Ruiz R, Carlos Garcia-Diaz J, Maroto C (2007) Considering scheduling and preventive maintenance in the flowshop sequencing problem. Comput Oper Res 34:3314\u20133330","journal-title":"Comput Oper Res"},{"issue":"4","key":"4407_CR57","doi-asserted-by":"crossref","first-page":"1240","DOI":"10.1080\/00207543.2013.848490","volume":"52","author":"H Seidgar","year":"2014","unstructured":"Seidgar H, Kiani M, Abedi M, Fazlollahtabar H (2014) An efficient imperialist competitive algorithm for scheduling in the two-stage assembly flow shop problem. Int J Prod Res 52(4):1240\u20131256","journal-title":"Int J Prod Res"},{"key":"4407_CR58","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1177\/0954405414563554","volume":"1","author":"H Seidgar","year":"2015","unstructured":"Seidgar H, Zandieh M, Fazlollahtabar H, Mahdavi I (2015) Simulated imperialist competitive algorithm in two-stage assembly flow shop with machine breakdowns and preventive maintenance. Proc Inst Mech Eng Part B J Eng Manuf 1:1. \nhttps:\/\/doi.org\/10.1177\/0954405414563554","journal-title":"Proc Inst Mech Eng Part B J Eng Manuf"},{"issue":"2","key":"4407_CR59","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1504\/IJOR.2017.083959","volume":"29","author":"H Seidgar","year":"2017","unstructured":"Seidgar H, Tadayoni Rad S, Shafaei R (2017) Scheduling of assembly flow shop problem and machines with random breakdowns. Int J Oper Res 29(2):273\u2013293","journal-title":"Int J Oper Res"},{"issue":"3","key":"4407_CR60","doi-asserted-by":"crossref","first-page":"805","DOI":"10.1080\/00207540903471486","volume":"49","author":"SA Seyed-Alagheband","year":"2011","unstructured":"Seyed-Alagheband SA, Fatemi Ghomi SMT, Zandieh M (2011) A simulated annealing algorithm for balancing the assembly line type II problem with sequence-dependent setup times between tasks. Int J Prod Res 49(3):805\u2013825","journal-title":"Int J Prod Res"},{"issue":"11","key":"4407_CR61","doi-asserted-by":"crossref","first-page":"3087","DOI":"10.1080\/00207540903536155","volume":"49","author":"E Shokrollahpour","year":"2011","unstructured":"Shokrollahpour E, Zandieh M, Dorri B (2011) A novel imperialist competitive algorithm for bi-criteria scheduling of the assembly flow shop problem. Int J Prod Res 49(11):3087\u20133103","journal-title":"Int J Prod Res"},{"issue":"10","key":"4407_CR62","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1108\/01443579610130682","volume":"16","author":"PPM Stoop","year":"1996","unstructured":"Stoop PPM, Weirs VCS (1996) The complexity of scheduling in practice. Int J Oper Prod Manag 16(10):37\u201353","journal-title":"Int J Oper Prod Manag"},{"issue":"1","key":"4407_CR63","doi-asserted-by":"crossref","first-page":"22","DOI":"10.1109\/4235.752918","volume":"3","author":"R Storn","year":"1999","unstructured":"Storn R, Price K (1999) System design by constraint adaptation and differential evolution. IEEE Trans Evol Comput 3(1):22\u201334","journal-title":"IEEE Trans Evol Comput"},{"issue":"3","key":"4407_CR64","doi-asserted-by":"crossref","first-page":"498","DOI":"10.1016\/S0377-2217(02)00245-X","volume":"146","author":"X Sun","year":"2003","unstructured":"Sun X, Morizawa K, Nagasawa H (2003) Powerful heuristics to minimize makespan in fixed, 3-machine, assembly-type flowshop scheduling. Eur J Oper Res 146(3):498\u2013516","journal-title":"Eur J Oper Res"},{"key":"4407_CR65","doi-asserted-by":"crossref","first-page":"392","DOI":"10.1016\/j.ijpe.2009.03.012","volume":"119","author":"CS Sung","year":"2009","unstructured":"Sung CS, Juhn J (2009) Makespan minimization for a 2-stage assembly scheduling problem subject to component available time constraint. Int J Prod Econ 119:392\u2013401","journal-title":"Int J Prod Econ"},{"key":"4407_CR66","doi-asserted-by":"crossref","first-page":"1038","DOI":"10.1016\/j.ijpe.2007.12.007","volume":"113","author":"CS Sung","year":"2008","unstructured":"Sung CS, Kim HA (2008) A two-stage multiple-machine assembly scheduling problem for minimizing sum of completion times. Int J Prod Econ 113:1038\u20131048","journal-title":"Int J Prod Econ"},{"issue":"1","key":"4407_CR67","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1016\/0925-5273(93)90007-8","volume":"32","author":"V Suresh","year":"1993","unstructured":"Suresh V, Chaudhuri D (1993) Dynamic scheduling: a survey of research. Int J Prod Econ 32(1):53\u201363","journal-title":"Int J Prod Econ"},{"key":"4407_CR68","doi-asserted-by":"crossref","first-page":"1238","DOI":"10.1016\/j.advengsoft.2010.06.004","volume":"41","author":"E Torabzadeh","year":"2010","unstructured":"Torabzadeh E, Zandieh M (2010) Cloud theory-based simulated annealing approach for scheduling in the two-stage assembly flow shop. Adv Eng Softw 41:1238\u20131243","journal-title":"Adv Eng Softw"},{"issue":"2","key":"4407_CR69","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1016\/S0305-0548(01)00098-3","volume":"30","author":"A Tozkapan","year":"2003","unstructured":"Tozkapan A, Kirca O, Chung C-S (2003) A branch and bound algorithm to minimise the total weighted flow time for the two-stage assembly scheduling problem. Comput Oper Res 30(2):309\u2013320","journal-title":"Comput Oper Res"},{"issue":"1","key":"4407_CR70","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1023\/A:1022235519958","volume":"6","author":"GE Vieira","year":"2003","unstructured":"Vieira GE, Hermann JW, Lin E (2003) Rescheduling manufacturing systems: a framework of strategies, policies and methods. J Sched 6(1):39\u201362","journal-title":"J Sched"},{"issue":"5","key":"4407_CR71","doi-asserted-by":"crossref","first-page":"702","DOI":"10.1287\/opre.45.5.702","volume":"45","author":"MY Wang","year":"1997","unstructured":"Wang MY, Sethi SP, Van de Velde SL (1997) Minimizing makespan in a class of reentrant shops. Oper Res 45(5):702\u2013712","journal-title":"Oper Res"},{"issue":"9","key":"4407_CR72","doi-asserted-by":"crossref","first-page":"2743","DOI":"10.1080\/00207543.2014.884290","volume":"52","author":"F Xiong","year":"2014","unstructured":"Xiong F, Xing K (2014) Meta-heuristics for the distributed two-stage assembly scheduling problem with bi-criteria of makespan and mean completion time. Int J Prod Res 52(9):2743\u20132766","journal-title":"Int J Prod Res"},{"issue":"4","key":"4407_CR73","doi-asserted-by":"crossref","first-page":"705","DOI":"10.1080\/00207548508904739","volume":"23","author":"M Yamamoto","year":"1985","unstructured":"Yamamoto M, Nof SY (1985) Scheduling\/rescheduling in the manufacturing operating system environment. Int J Prod Res 23(4):705\u2013722","journal-title":"Int J Prod Res"},{"key":"4407_CR74","doi-asserted-by":"crossref","first-page":"2449","DOI":"10.1080\/00207540802662896","volume":"48","author":"M Zandieh","year":"2010","unstructured":"Zandieh M, Adibi MA (2010) Dynamic job shop scheduling using variable neighborhood search. Int J Prod Res 48:2449\u20132458","journal-title":"Int J Prod Res"},{"key":"4407_CR75","doi-asserted-by":"crossref","first-page":"6999","DOI":"10.1080\/00207540802400636","volume":"47","author":"M Zandieh","year":"2009","unstructured":"Zandieh M, Gholami M (2009) An immune algorithm for scheduling a hybrid flow shop with sequence-dependent setup times and machines with random breakdowns. Int J Prod Res 47:6999\u20137027","journal-title":"Int J Prod Res"}],"container-title":["Soft Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-019-04407-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00500-019-04407-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-019-04407-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,10,6]],"date-time":"2020-10-06T23:23:04Z","timestamp":1602026584000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00500-019-04407-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,10,8]]},"references-count":74,"journal-issue":{"issue":"11","published-print":{"date-parts":[[2020,6]]}},"alternative-id":["4407"],"URL":"https:\/\/doi.org\/10.1007\/s00500-019-04407-3","relation":{},"ISSN":["1432-7643","1433-7479"],"issn-type":[{"value":"1432-7643","type":"print"},{"value":"1433-7479","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,10,8]]},"assertion":[{"value":"8 October 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Compliance with ethical standards"}},{"value":"Authors declare that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"This article does not contain any studies with human participants or animals performed by any of the authors.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethical approval"}}]}}