{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,16]],"date-time":"2026-06-16T18:50:52Z","timestamp":1781635852582,"version":"3.54.5"},"reference-count":40,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2018,6,13]],"date-time":"2018-06-13T00:00:00Z","timestamp":1528848000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Shanghai Key Laboratory of Advanced Manufacturing Environment"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Ambient Intell Human Comput"],"published-print":{"date-parts":[[2019,3]]},"DOI":"10.1007\/s12652-018-0903-3","type":"journal-article","created":{"date-parts":[[2018,6,15]],"date-time":"2018-06-15T11:24:19Z","timestamp":1529061859000},"page":"979-990","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":39,"title":["Solving the two-stage hybrid flow shop scheduling problem based on mutant firefly algorithm"],"prefix":"10.1007","volume":"10","author":[{"given":"Beibei","family":"Fan","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Wenwei","family":"Yang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Zaifang","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2018,6,13]]},"reference":[{"issue":"1\u20132","key":"903_CR1","doi-asserted-by":"publisher","first-page":"166","DOI":"10.1007\/s00170-007-0950-y","volume":"37","author":"A Allahverdi","year":"2008","unstructured":"Allahverdi A, Al-Anzi FS (2008) The two-stage assembly flowshop scheduling problem with bicriteria of makespan and mean completion time. Int J Adv Manuf Tech 37(1\u20132):166\u2013177","journal-title":"Int J Adv Manuf Tech"},{"issue":"2","key":"903_CR2","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1007\/s10845-013-0775-5","volume":"26","author":"A Allahverdi","year":"2015","unstructured":"Allahverdi A, Aydilek H (2015) The two stage assembly flowshop scheduling problem to minimize total tardiness. J Intell Manuf 26(2):225\u2013237","journal-title":"J Intell Manuf"},{"issue":"3","key":"903_CR3","doi-asserted-by":"publisher","first-page":"466","DOI":"10.1016\/j.cie.2013.04.007","volume":"65","author":"W Bo\u017cejko","year":"2013","unstructured":"Bo\u017cejko W, Pempera J, Smutnicki C (2013) Parallel tabu search algorithm for the hybrid flow shop problem. Comput Ind Eng 65(3):466\u2013474","journal-title":"Comput Ind Eng"},{"issue":"1","key":"903_CR4","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1016\/j.ijpe.2012.05.015","volume":"141","author":"FD Chou","year":"2013","unstructured":"Chou FD (2013) Particle swarm optimization with cocktail decoding method for hybrid flow shop scheduling problems with multiprocessor tasks. Int J Prod Econ 141(1):137\u2013145","journal-title":"Int J Prod Econ"},{"issue":"8","key":"903_CR5","doi-asserted-by":"publisher","first-page":"3729","DOI":"10.1016\/j.asoc.2013.03.006","volume":"13","author":"TP Chung","year":"2013","unstructured":"Chung TP, Liao CJ (2013) An immunoglobulin-based artificial immune system for solving the hybrid flow shop problem. Appl Soft Comput 13(8):3729\u20133736","journal-title":"Appl Soft Comput"},{"issue":"3","key":"903_CR6","doi-asserted-by":"publisher","first-page":"3056","DOI":"10.1016\/j.asoc.2010.12.006","volume":"11","author":"O Engin","year":"2011","unstructured":"Engin O, Ceran G, Yilmaz MK (2011) An efficient genetic algorithm for hybrid flow shop scheduling with multiprocessor task problems. Appl Soft Comput 11(3):3056\u20133065","journal-title":"Appl Soft Comput"},{"issue":"5\u20138","key":"903_CR7","doi-asserted-by":"publisher","first-page":"787","DOI":"10.1007\/s00170-012-4217-x","volume":"65","author":"P Fattahi","year":"2013","unstructured":"Fattahi P, Hosseini et al (2013) A mathematical model and extension algorithm for assembly flexible flow;shop scheduling problem. Int J Adv Manuf Technol 65(5\u20138):787\u2013802","journal-title":"Int J Adv Manuf Technol"},{"issue":"4","key":"903_CR8","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1057\/jors.1988.63","volume":"39","author":"JND Gupta","year":"1988","unstructured":"Gupta JND (1988) Two-stage hybrid flowshop scheduling problem. J Oper Res Soc 39(4):359\u2013364","journal-title":"J Oper Res Soc"},{"issue":"5","key":"903_CR9","first-page":"963","volume":"23","author":"Z Hongsheng","year":"2017","unstructured":"Hongsheng Z, Dongjin Y, Zhang L (2017) Multi-QoS cloud workflow scheduling based on firefly algorithm and dynamic priorities. CIMS 23(5):963\u2013971","journal-title":"CIMS"},{"key":"903_CR10","unstructured":"Hosseini SMH (2016) Modeling the hybrid flow shop scheduling problem followed by an assembly stage considering aging effects and preventive maintenance activities. pp 1215\u20131233"},{"issue":"9","key":"903_CR11","doi-asserted-by":"publisher","first-page":"2787","DOI":"10.1080\/00207543.2014.994075","volume":"53","author":"GQ Huang","year":"2015","unstructured":"Chen J, Huang GQ, Luo H et al (2015) Synchronisation of production scheduling and shipment in an assembly flowshop. Int J Prod Res 53(9):2787\u20132802","journal-title":"Int J Prod Res"},{"issue":"4","key":"903_CR12","doi-asserted-by":"publisher","first-page":"1293","DOI":"10.1016\/j.asoc.2010.03.008","volume":"10","author":"C Kahraman","year":"2010","unstructured":"Kahraman C, Engin O (2010) Multiprocessor task scheduling in multistage hybrid flow-shops: a parallel greedy algorithm approach. Appl Soft Comput 10(4):1293\u20131300","journal-title":"Appl Soft Comput"},{"key":"903_CR13","unstructured":"Langjun P (2016) Research on Firefly-algorithm-based flexible job shop scheduling problem. Dissertation, Xiangtan University"},{"issue":"C","key":"903_CR14","first-page":"487","volume":"316","author":"JQ Li","year":"2015","unstructured":"Li JQ, Pan QK (2015) Solving the large-scale hybrid flow shop scheduling problem with limited buffers by a hybrid artificial bee colony algorithm. Elsevier Sci 316(C):487\u2013502","journal-title":"Elsevier Sci"},{"issue":"3","key":"903_CR15","first-page":"567","volume":"23","author":"X Li","year":"2017","unstructured":"Li X, Fu P, Xia L et al (2017) Integrated sequencing of serial parallel mixed assembly line based artificial bee colony. Robot Cim Int Manuf 23(3):567\u2013574","journal-title":"Robot Cim Int Manuf"},{"key":"903_CR16","first-page":"1","volume":"2016","author":"X Liang","year":"2016","unstructured":"Liang X, Huang M, Ning T (2016) Flexible job shop scheduling based on improved hybrid immune algorithm. J Ambient Intell Human Comput 2016:1\u20137","journal-title":"J Ambient Intell Human Comput"},{"issue":"6","key":"903_CR17","doi-asserted-by":"publisher","first-page":"1755","DOI":"10.1016\/j.asoc.2012.01.011","volume":"12","author":"CJ Liao","year":"2012","unstructured":"Liao CJ, Tjandradjaja E, Chung TP (2012) An approach using particle swarm optimization and bottleneck heuristic to solve HFSP. Appl Soft Comput 12(6):1755\u20131764","journal-title":"Appl Soft Comput"},{"issue":"4","key":"903_CR18","doi-asserted-by":"publisher","first-page":"1094","DOI":"10.1080\/00207543.2014.944631","volume":"53","author":"BMT Lin","year":"2015","unstructured":"Lin BMT (2015) Two-stage flow shop scheduling with dedicated machines. Int J Prod Res 53(4):1094\u20131097","journal-title":"Int J Prod Res"},{"key":"903_CR19","first-page":"1","volume":"2016","author":"IC Lin","year":"2016","unstructured":"Lin IC, Cheng CY (2016) Case study of physical internet for improving efficiency in solar cell industry. J Ambient Intell Human Comput 2016:1\u201310","journal-title":"J Ambient Intell Human Comput"},{"key":"903_CR20","unstructured":"Luo R (2016) Study on the scheduling and optimization on the manufacturing and assembly in Hybrid Flow shop for one-of-a kind production. Dissertation, Guangdong University of Technology"},{"issue":"3","key":"903_CR21","doi-asserted-by":"publisher","first-page":"709","DOI":"10.1007\/s12652-017-0469-5","volume":"9","author":"JIR Molano","year":"2017","unstructured":"Molano JIR, Lovelle JMC, Montenegro CE et al (2017) Metamodel for integration of internet of things, social networks, the cloud and industry 4.0. J Ambient Intell Human Comput 9(3):709\u2013723","journal-title":"J Ambient Intell Human Comput"},{"key":"903_CR22","first-page":"1","volume":"2017","author":"T Ning","year":"2017","unstructured":"Ning T, Jin H, Song X et al (2017) An improved quantum genetic algorithm based on MAGTD for dynamic FJSP. J Ambient Intell Human Comput 2017:1\u201310","journal-title":"J Ambient Intell Human Comput"},{"issue":"1","key":"903_CR23","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1016\/j.cor.2009.04.008","volume":"37","author":"T Nishi","year":"2010","unstructured":"Nishi T, Hiranaka Y, Inuiguchi M (2010) Lagrangian relaxation with cut generation for hybrid flowshop scheduling problems to minimize the total weighted tardiness. Comput Oper Res 37(1):189\u2013198","journal-title":"Comput Oper Res"},{"issue":"2","key":"903_CR24","doi-asserted-by":"publisher","first-page":"42","DOI":"10.1016\/j.omega.2013.12.004","volume":"45","author":"QK Pan","year":"2014","unstructured":"Pan QK, Wang L, Li JQ et al (2014) A novel discrete artificial bee colony algorithm for the hybrid flowshop scheduling problem with makespan minimisation. Omega 45(2):42\u201356","journal-title":"Omega"},{"issue":"2","key":"903_CR25","doi-asserted-by":"publisher","first-page":"290","DOI":"10.1287\/opre.27.2.290","volume":"27","author":"RJ Paul","year":"1979","unstructured":"Paul RJ (1979) A production scheduling problem in the glass-container industry. Oper Res 27(2):290\u2013302","journal-title":"Oper Res"},{"issue":"8","key":"903_CR26","doi-asserted-by":"publisher","first-page":"1439","DOI":"10.1016\/j.cor.2009.11.001","volume":"37","author":"I Ribas","year":"2010","unstructured":"Ribas I, Leisten R, Frami\u00f1an JM (2010) Review and classification of hybrid flow shop scheduling problems from a production system and a solutions procedure perspective. Comput Oper Res 37(8):1439\u20131454","journal-title":"Comput Oper Res"},{"issue":"1","key":"903_CR27","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.ejor.2009.09.024","volume":"205","author":"R Ruizab","year":"2010","unstructured":"Ruizab R (2010) The hybrid flow shop scheduling problem. Eur J Oper Res 205(1):1\u201318","journal-title":"Eur J Oper Res"},{"issue":"4","key":"903_CR28","first-page":"1","volume":"54","author":"E Teymourian","year":"2016","unstructured":"Teymourian E (2016) Minimising makespan in the two-stage assembly hybrid flow shop scheduling problem using artificial immune systems. Int J Prod Res 54(4):1\u201322","journal-title":"Int J Prod Res"},{"key":"903_CR29","unstructured":"Tian Y (2010) Research on particle swarm optimization algorithm an its application. Dissertation, Jilin University"},{"issue":"5","key":"903_CR30","first-page":"1087","volume":"48","author":"Y Tian","year":"2011","unstructured":"Tian Y, Liu D(2011) A hybrid particle swarm optimization method for flow shop scheduling problem. Acta Electron Sin 48(5):1087\u20131093","journal-title":"Acta Electron Sin"},{"issue":"10","key":"903_CR31","doi-asserted-by":"publisher","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 flowshop. Adv Eng Softw 41(10):1238\u20131243","journal-title":"Adv Eng Softw"},{"issue":"06","key":"903_CR32","first-page":"1304","volume":"19","author":"S Wang","year":"2013","unstructured":"Wang S, Wang L, Xu Y (2013) Estimation of distribution algorithm for solving hybrid flow-shop scheduling problem with identical parallel machine. Comput Integr Manuf Syst 19(06):1304\u20131312","journal-title":"Comput Integr Manuf Syst"},{"issue":"4","key":"903_CR33","doi-asserted-by":"publisher","first-page":"1143","DOI":"10.1080\/00207543.2014.949363","volume":"53","author":"S Wang","year":"2015","unstructured":"Wang S, Liu M, Chu C (2015) A branch-and-bound algorithm for two-stage no-wait hybrid flow-shop scheduling. Int J Prod Res 53(4):1143\u20131167","journal-title":"Int J Prod Res"},{"issue":"12","key":"903_CR34","first-page":"1","volume":"2017","author":"L Wang","year":"2017","unstructured":"Wang L, Guo C, Li Y et al (2017) An outsourcing service selection method using ANN and SFLA algorithms for cement equipment manufacturing enterprises in cloud manufacturing. J Ambient Intell Human Comput 2017(12):1\u201315","journal-title":"J Ambient Intell Human Comput"},{"issue":"5","key":"903_CR35","first-page":"1006","volume":"18","author":"H Xuan","year":"2012","unstructured":"Xuan H (2012) Three-stage HFS scheduling problem with serial batching machines. Comput Integr Manuf Syst 18(5):1006\u20131010","journal-title":"Comput Integr Manuf Syst"},{"key":"903_CR36","doi-asserted-by":"crossref","unstructured":"Yang XS (2009) Firefly algorithms for multimodal optimization. In: International symposium on stochastic algorithms, Springer, Berlin, pp 169\u2013178","DOI":"10.1007\/978-3-642-04944-6_14"},{"issue":"2","key":"903_CR37","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1504\/IJBIC.2010.032124","volume":"2","author":"XS Yang","year":"2010","unstructured":"Yang XS (2010) Firefly Algorithm, Stochastic Test Functions and Design Optimisation. Int J Bio-Inspir Comput 2(2):78\u201384(7)","journal-title":"Int J Bio-Inspir Comput"},{"issue":"C","key":"903_CR38","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.cor.2014.11.012","volume":"58","author":"J Yang","year":"2015","unstructured":"Yang J (2015) Minimizing total completion time in a two-stage hybrid flow shop with dedicated machines at the first stage. Comput Oper Res 58(C):1\u20138","journal-title":"Comput Oper Res"},{"issue":"3","key":"903_CR39","first-page":"609","volume":"23","author":"Q Zhang","year":"2017","unstructured":"Zhang Q, Zuoming Z (2017) Discrete fruit fly optimization algorithm based on dominant population for solving no-wait flow shop scheduling problem. Comput Integr Manuf Syst CIMS 23(3):609\u2013615","journal-title":"Comput Integr Manuf Syst CIMS"},{"issue":"9","key":"903_CR40","doi-asserted-by":"publisher","first-page":"2610","DOI":"10.1080\/00207543.2015.1086037","volume":"55","author":"RY Zhong","year":"2017","unstructured":"Zhong RY, Xu C, Chen C et al (2017) Big data analytics for physical internet-based intelligent manufacturing shop floors. Int J Prod Res 55(9):2610\u20132621","journal-title":"Int J Prod Res"}],"container-title":["Journal of Ambient Intelligence and Humanized Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s12652-018-0903-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12652-018-0903-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12652-018-0903-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,12,23]],"date-time":"2019-12-23T04:49:28Z","timestamp":1577076568000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s12652-018-0903-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,6,13]]},"references-count":40,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2019,3]]}},"alternative-id":["903"],"URL":"https:\/\/doi.org\/10.1007\/s12652-018-0903-3","relation":{},"ISSN":["1868-5137","1868-5145"],"issn-type":[{"value":"1868-5137","type":"print"},{"value":"1868-5145","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,6,13]]},"assertion":[{"value":"29 December 2017","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 June 2018","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 June 2018","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}