{"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":1781635852579,"version":"3.54.5"},"reference-count":42,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2019,3,6]],"date-time":"2019-03-06T00:00:00Z","timestamp":1551830400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2019,3,6]],"date-time":"2019-03-06T00:00:00Z","timestamp":1551830400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"the National Natural Science Foundation of China","doi-asserted-by":"crossref","award":["51405089"],"award-info":[{"award-number":["51405089"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"name":"the Science and Technology Planning Project of Guangdong Province","award":["2015B010131008"],"award-info":[{"award-number":["2015B010131008"]}]},{"name":"the Science and Technology Planning Project of Guangdong Province","award":["2015B090921007"],"award-info":[{"award-number":["2015B090921007"]}]},{"DOI":"10.13039\/501100002858","name":"China Postdoctoral Science Foundation","doi-asserted-by":"publisher","award":["2018M633008"],"award-info":[{"award-number":["2018M633008"]}],"id":[{"id":"10.13039\/501100002858","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Oper Res Int J"],"published-print":{"date-parts":[[2021,6]]},"DOI":"10.1007\/s12351-019-00470-8","type":"journal-article","created":{"date-parts":[[2019,3,6]],"date-time":"2019-03-06T20:10:27Z","timestamp":1551903027000},"page":"1153-1178","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":12,"title":["Bi-objective hybrid flow shop scheduling with common due date"],"prefix":"10.1007","volume":"21","author":[{"given":"Zhi","family":"Li","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ray Y.","family":"Zhong","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5267-1020","authenticated-orcid":false,"given":"Ali Vatankhah","family":"Barenji","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"J. J.","family":"Liu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"C. X.","family":"Yu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"George Q.","family":"Huang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2019,3,6]]},"reference":[{"key":"470_CR1","doi-asserted-by":"publisher","first-page":"1017","DOI":"10.1007\/s00170-014-6177-9","volume":"75","author":"H Asefi","year":"2014","unstructured":"Asefi H, Jolai F, Rabiee M, Araghi MT (2014) A hybrid NSGA-II and VNS for solving a bi-objective no-wait flexible flowshop scheduling problem. Int J Adv Manuf Technol 75:1017\u20131033","journal-title":"Int J Adv Manuf Technol"},{"key":"470_CR2","doi-asserted-by":"publisher","first-page":"168781401666347","DOI":"10.1177\/1687814016663476","volume":"8","author":"A Azizi","year":"2016","unstructured":"Azizi A, Vatankhah Barenji A, Hashmipour M (2016) Optimizing radio frequency identification network planning through ring probabilistic logic neurons. Adv Mech Eng 8:1687814016663476","journal-title":"Adv Mech Eng"},{"key":"470_CR3","doi-asserted-by":"crossref","unstructured":"Barenji AV (2013) An RFID-based distributed control system for flexible manufacturing system. Eastern Mediterranean University (EMU)-Do\u011fu Akdeniz \u00dcniversitesi (DA\u00dc)","DOI":"10.1109\/INTECH.2013.6653649"},{"key":"470_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.advengsoft.2015.08.010","volume":"91","author":"AV Barenji","year":"2016","unstructured":"Barenji AV, Barenji RV, Hashemipour M (2016) Flexible testing platform for employment of RFID-enabled multi-agent system on flexible assembly line. Adv Eng Softw 91:1\u201311","journal-title":"Adv Eng Softw"},{"key":"470_CR5","doi-asserted-by":"publisher","first-page":"3123","DOI":"10.1007\/s00170-016-9299-4","volume":"89","author":"AV Barenji","year":"2017","unstructured":"Barenji AV, Barenji RV, Roudi D, Hashemipour M (2017) A dynamic multi-agent-based scheduling approach for SMEs. Int J Adv Manuf Technol 89:3123\u20133137","journal-title":"Int J Adv Manuf Technol"},{"key":"470_CR6","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1016\/S0360-8352(99)00136-9","volume":"36","author":"R Cheng","year":"1999","unstructured":"Cheng R, Gen M, Tsujimura Y (1999) A tutorial survey of job-shop scheduling problems using genetic algorithms, part II: hybrid genetic search strategies. Comput Ind Eng 36:343\u2013364","journal-title":"Comput Ind Eng"},{"key":"470_CR7","volume-title":"Evolutionary algorithms for solving multi-objective problems","author":"CAC Coello","year":"2007","unstructured":"Coello CAC, Lamont GB, Van Veldhuizen DA (2007) Evolutionary algorithms for solving multi-objective problems. Springer, New York"},{"key":"470_CR8","doi-asserted-by":"publisher","first-page":"182","DOI":"10.1109\/4235.996017","volume":"6","author":"K Deb","year":"2002","unstructured":"Deb K, Pratap A, Agarwal S, Meyarivan T (2002) A fast and elitist multiobjective genetic algorithm: NSGA-II. IEEE Trans Evol Comput 6:182\u2013197","journal-title":"IEEE Trans Evol Comput"},{"key":"470_CR9","doi-asserted-by":"crossref","unstructured":"Eberhart R, Kennedy J (1995) A new optimizer using particle swarm theory. In: Proceedings of the Sixth International Symposium on Micro Machine and Human Science, 1995 MHS\u201995, IEEE, pp 39\u201343","DOI":"10.1109\/MHS.1995.494215"},{"key":"470_CR10","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:3056\u20133065","journal-title":"Appl Soft Comput"},{"key":"470_CR11","doi-asserted-by":"publisher","first-page":"433","DOI":"10.1016\/j.ejor.2013.12.003","volume":"236","author":"E Figielska","year":"2014","unstructured":"Figielska E (2014) A heuristic for scheduling in a two-stage hybrid flowshop with renewable resources shared among the stages. Eur J Oper Res 236:433\u2013444","journal-title":"Eur J Oper Res"},{"key":"470_CR12","doi-asserted-by":"publisher","first-page":"535","DOI":"10.1016\/S0377-2217(99)00224-6","volume":"125","author":"J Grabowski","year":"2000","unstructured":"Grabowski J, Pempera J (2000) Sequencing of jobs in some production system. Eur J Oper Res 125:535\u2013550","journal-title":"Eur J Oper Res"},{"key":"470_CR13","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1057\/jors.1988.63","volume":"39","author":"JN Gupta","year":"1988","unstructured":"Gupta JN (1988) Two-stage, hybrid flowshop scheduling problem. J Oper Res Soc 39:359\u2013364","journal-title":"J Oper Res Soc"},{"key":"470_CR14","doi-asserted-by":"publisher","first-page":"531","DOI":"10.1016\/j.ijpe.2016.10.001","volume":"182","author":"L Hidri","year":"2016","unstructured":"Hidri L (2016) Note on the hybrid flowshop scheduling problem with multiprocessor tasks. Int J Prod Econ 182:531\u2013534","journal-title":"Int J Prod Econ"},{"key":"470_CR15","doi-asserted-by":"publisher","first-page":"593","DOI":"10.1016\/S0305-0548(03)00016-9","volume":"31","author":"SK Iyer","year":"2004","unstructured":"Iyer SK, Saxena B (2004) Improved genetic algorithm for the permutation flowshop scheduling problem. Comput Oper Res 31:593\u2013606","journal-title":"Comput Oper Res"},{"key":"470_CR16","doi-asserted-by":"publisher","first-page":"6196","DOI":"10.1016\/j.eswa.2015.03.012","volume":"42","author":"S Jun","year":"2015","unstructured":"Jun S, Park J (2015) A hybrid genetic algorithm for the hybrid flow shop scheduling problem with nighttime work and simultaneous work constraints: a case study from the transformer industry. Expert Syst Appl 42:6196\u20136204","journal-title":"Expert Syst Appl"},{"key":"470_CR17","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1007\/s10732-007-9061-z","volume":"15","author":"Y-D Kim","year":"2009","unstructured":"Kim Y-D, Joo B-J, Shin J-H (2009) Heuristics for a two-stage hybrid flowshop scheduling problem with ready times and a product-mix ratio constraint. J Heuristics 15:19\u201342","journal-title":"J Heuristics"},{"key":"470_CR18","doi-asserted-by":"publisher","first-page":"76","DOI":"10.1016\/j.cor.2015.05.010","volume":"65","author":"D Lei","year":"2016","unstructured":"Lei D, Guo X (2016) Hybrid flow shop scheduling with not-all-machines options via local search with controlled deterioration. Comput Oper Res 65:76\u201382","journal-title":"Comput Oper Res"},{"key":"470_CR19","doi-asserted-by":"publisher","first-page":"873","DOI":"10.1007\/s10845-014-0874-y","volume":"26","author":"D Li","year":"2015","unstructured":"Li D, Meng X, Liang Q, Zhao J (2015) A heuristic-search genetic algorithm for multi-stage hybrid flow shop scheduling with single processing machines and batch processing machines. J Intell Manuf 26:873\u2013890","journal-title":"J Intell Manuf"},{"key":"470_CR20","doi-asserted-by":"publisher","first-page":"534","DOI":"10.1177\/0954405414555559","volume":"230","author":"F Liang","year":"2016","unstructured":"Liang F, Fung RY (2016) Coordination mechanism in real-time scheduling of virtual cellular manufacturing systems. Proc Inst Mech Eng Part B J Eng Manuf 230:534\u2013547","journal-title":"Proc Inst Mech Eng Part B J Eng Manuf"},{"key":"470_CR21","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1016\/S0360-8352(99)00023-6","volume":"37","author":"R Linn","year":"1999","unstructured":"Linn R, Zhang W (1999) Hybrid flow shop scheduling: a survey. Comput Ind Eng 37:57\u201361","journal-title":"Comput Ind Eng"},{"key":"470_CR22","doi-asserted-by":"publisher","first-page":"423","DOI":"10.1016\/j.ijpe.2013.01.028","volume":"146","author":"H Luo","year":"2013","unstructured":"Luo H, Du B, Huang GQ, Chen H, Li X (2013) Hybrid flow shop scheduling considering machine electricity consumption cost. Int J Prod Econ 146:423\u2013439","journal-title":"Int J Prod Econ"},{"key":"470_CR23","doi-asserted-by":"publisher","first-page":"64","DOI":"10.1016\/j.swevo.2017.06.003","volume":"38","author":"T Meng","year":"2017","unstructured":"Meng T, Pan Q-K, Li J-Q, Sang H-Y (2017) An improved migrating birds optimization for an integrated lot-streaming flow shop scheduling problem. Swarm Evolut Comput 38:64\u201378","journal-title":"Swarm Evolut Comput"},{"key":"470_CR24","doi-asserted-by":"publisher","first-page":"622","DOI":"10.1016\/j.epsr.2008.09.011","volume":"79","author":"P Murugan","year":"2009","unstructured":"Murugan P, Kannan S, Baskar S (2009) NSGA-II algorithm for multi-objective generation expansion planning problem. Electr Power Syst Res 79:622\u2013628","journal-title":"Electr Power Syst Res"},{"key":"470_CR25","doi-asserted-by":"publisher","first-page":"236","DOI":"10.1016\/j.cor.2009.04.017","volume":"37","author":"B Naderi","year":"2010","unstructured":"Naderi B, Ruiz R, Zandieh M (2010) Algorithms for a realistic variant of flowshop scheduling. Comput Oper Res 37:236\u2013246","journal-title":"Comput Oper Res"},{"key":"470_CR26","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1109\/TASE.2012.2204874","volume":"10","author":"Q-K Pan","year":"2013","unstructured":"Pan Q-K, Wang L, Mao K, Zhao J-H, Zhang M (2013) An effective artificial bee colony algorithm for a real-world hybrid flowshop problem in steelmaking process. IEEE Trans Autom Sci Eng 10:307\u2013322","journal-title":"IEEE Trans Autom Sci Eng"},{"key":"470_CR27","doi-asserted-by":"publisher","first-page":"42","DOI":"10.1016\/j.omega.2013.12.004","volume":"45","author":"Q-K Pan","year":"2014","unstructured":"Pan Q-K, Wang L, Li J-Q, Duan J-H (2014) A novel discrete artificial bee colony algorithm for the hybrid flowshop scheduling problem with makespan minimisation. Omega 45:42\u201356","journal-title":"Omega"},{"key":"470_CR28","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1016\/j.amc.2017.01.004","volume":"303","author":"Q-K Pan","year":"2017","unstructured":"Pan Q-K, Gao L, Li X-Y, Gao K-Z (2017) Effective metaheuristics for scheduling a hybrid flowshop with sequence-dependent setup times. Appl Math Comput 303:89\u2013112","journal-title":"Appl Math Comput"},{"key":"470_CR29","doi-asserted-by":"publisher","first-page":"1229","DOI":"10.1007\/s00170-013-5375-1","volume":"71","author":"M Rabiee","year":"2014","unstructured":"Rabiee M, Rad RS, Mazinani M, Shafaei R (2014) An intelligent hybrid meta-heuristic for solving a case of no-wait two-stage flexible flow shop scheduling problem with unrelated parallel machines. Int J Adv Manuf Technol 71:1229\u20131245","journal-title":"Int J Adv Manuf Technol"},{"key":"470_CR30","doi-asserted-by":"publisher","first-page":"1227","DOI":"10.1007\/s00170-008-1558-6","volume":"41","author":"A Rahimi-Vahed","year":"2009","unstructured":"Rahimi-Vahed A, Dangchi M, Rafiei H, Salimi E (2009) A novel hybrid multi-objective shuffled frog-leaping algorithm for a bi-criteria permutation flow shop scheduling problem. Int J Adv Manuf Technol 41:1227\u20131239","journal-title":"Int J Adv Manuf Technol"},{"key":"470_CR31","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.ejor.2009.09.024","volume":"205","author":"R Ruiz","year":"2010","unstructured":"Ruiz R, V\u00e1zquez-Rodr\u00edguez JA (2010) The hybrid flow shop scheduling problem. Eur J Oper Res 205:1\u201318","journal-title":"Eur J Oper Res"},{"key":"470_CR32","doi-asserted-by":"publisher","first-page":"1065","DOI":"10.1016\/j.eswa.2009.06.041","volume":"37","author":"D Sha","year":"2010","unstructured":"Sha D, Lin H-H (2010) A multi-objective PSO for job-shop scheduling problems. Expert Syst Appl 37:1065\u20131070","journal-title":"Expert Syst Appl"},{"key":"470_CR33","doi-asserted-by":"crossref","unstructured":"Shi Y, Eberhart RC (1999) Empirical study of particle swarm optimization. In: Proceedings of the 1999 congress on Evolutionary computation, 1999 CEC 99. IEEE, pp 1945\u20131950","DOI":"10.1109\/CEC.1999.785511"},{"key":"470_CR34","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1080\/0951192X.2011.552527","volume":"24","author":"M Solimanpur","year":"2011","unstructured":"Solimanpur M, Elmi A (2011) A tabu search approach for group scheduling in buffer-constrained flow shop cells. Int J Comput Integr Manuf 24:257\u2013268","journal-title":"Int J Comput Integr Manuf"},{"key":"470_CR35","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1162\/evco.1994.2.3.221","volume":"2","author":"N Srinivas","year":"1994","unstructured":"Srinivas N, Deb K (1994) Muiltiobjective optimization using nondominated sorting in genetic algorithms. Evol Comput 2:221\u2013248","journal-title":"Evol Comput"},{"key":"470_CR36","doi-asserted-by":"publisher","first-page":"5072","DOI":"10.1016\/j.ins.2007.06.001","volume":"177","author":"R Tavakkoli-Moghaddam","year":"2007","unstructured":"Tavakkoli-Moghaddam R, Rahimi-Vahed A, Mirzaei AH (2007) A hybrid multi-objective immune algorithm for a flow shop scheduling problem with bi-objectives: weighted mean completion time and weighted mean tardiness. Inf Sci 177:5072\u20135090","journal-title":"Inf Sci"},{"key":"470_CR37","doi-asserted-by":"publisher","first-page":"869","DOI":"10.1080\/00207543.2012.676685","volume":"51","author":"M Thuerer","year":"2013","unstructured":"Thuerer M, Stevenson M, Silva C, Land M, Filho MG (2013) Workload control and order release in two-level multi-stage job shops: an assessment by simulation. Int J Prod Res 51:869\u2013882","journal-title":"Int J Prod Res"},{"key":"470_CR38","first-page":"447","volume":"231","author":"A Vatankhah Barenji","year":"2017","unstructured":"Vatankhah Barenji A, Vatankhah BR (2017) Improving multi-agent manufacturing control system by indirect communication based on ant agents. Proc Inst Mech Eng Part I J Syst Control Eng 231:447\u2013458","journal-title":"Proc Inst Mech Eng Part I J Syst Control Eng"},{"key":"470_CR39","doi-asserted-by":"publisher","first-page":"907","DOI":"10.1016\/j.cor.2007.11.004","volume":"36","author":"X Wang","year":"2009","unstructured":"Wang X, Tang L (2009) A tabu search heuristic for the hybrid flowshop scheduling with finite intermediate buffers. Comput Oper Res 36:907\u2013918","journal-title":"Comput Oper Res"},{"key":"470_CR40","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1080\/0951192X.2014.880803","volume":"28","author":"S-Y Wang","year":"2015","unstructured":"Wang S-Y, Wang L, Liu M, Xu Y (2015) An order-based estimation of distribution algorithm for stochastic hybrid flow-shop scheduling problem. Int J Comput Integr Manuf 28:307\u2013320","journal-title":"Int J Comput Integr Manuf"},{"key":"470_CR41","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1016\/j.asoc.2016.12.021","volume":"52","author":"B Zhang","year":"2017","unstructured":"Zhang B, Q-K Pan, Gao L, X-l Zhang, Sang H-Y, Li J-Q (2017) An effective modified migrating birds optimization for hybrid flowshop scheduling problem with lot streaming. Appl Soft Comput 52:14\u201327","journal-title":"Appl Soft Comput"},{"key":"470_CR42","doi-asserted-by":"publisher","first-page":"3371","DOI":"10.1007\/s00170-016-9034-1","volume":"88","author":"J Zhou","year":"2017","unstructured":"Zhou J, Yao X (2017) A hybrid artificial bee colony algorithm for optimal selection of QoS-based cloud manufacturing service composition. Int J Adv Manuf Technol 88:3371\u20133387","journal-title":"Int J Adv Manuf Technol"}],"container-title":["Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12351-019-00470-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s12351-019-00470-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12351-019-00470-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,9,13]],"date-time":"2022-09-13T02:58:37Z","timestamp":1663037917000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s12351-019-00470-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,3,6]]},"references-count":42,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2021,6]]}},"alternative-id":["470"],"URL":"https:\/\/doi.org\/10.1007\/s12351-019-00470-8","relation":{},"ISSN":["1109-2858","1866-1505"],"issn-type":[{"value":"1109-2858","type":"print"},{"value":"1866-1505","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,3,6]]},"assertion":[{"value":"24 November 2017","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 November 2018","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 February 2019","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 March 2019","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}