{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,10]],"date-time":"2026-03-10T12:19:01Z","timestamp":1773145141683,"version":"3.50.1"},"reference-count":29,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2019,7,16]],"date-time":"2019-07-16T00:00:00Z","timestamp":1563235200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2019,7,16]],"date-time":"2019-07-16T00:00:00Z","timestamp":1563235200000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"name":"Scientific and Technological Project of Henan Province","award":["152102210153"],"award-info":[{"award-number":["152102210153"]}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"crossref","award":["61876169"],"award-info":[{"award-number":["61876169"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"crossref","award":["61673404"],"award-info":[{"award-number":["61673404"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"crossref","award":["61473266"],"award-info":[{"award-number":["61473266"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"crossref","award":["61806179"],"award-info":[{"award-number":["61806179"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"name":"Program for Science & Technology Innovation Talents in Universities of Henan Province in China","award":["16HASTIT041"],"award-info":[{"award-number":["16HASTIT041"]}]},{"name":"Program for Science & Technology Innovation Talents in Universities of Henan Province in China","award":["16HASTIT033"],"award-info":[{"award-number":["16HASTIT033"]}]},{"DOI":"10.13039\/501100002858","name":"China Postdoctoral Science Foundation","doi-asserted-by":"publisher","award":["2017M622373"],"award-info":[{"award-number":["2017M622373"]}],"id":[{"id":"10.13039\/501100002858","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Memetic Comp."],"published-print":{"date-parts":[[2019,12]]},"DOI":"10.1007\/s12293-019-00290-5","type":"journal-article","created":{"date-parts":[[2019,7,16]],"date-time":"2019-07-16T05:39:05Z","timestamp":1563255545000},"page":"407-422","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":33,"title":["Multi-objective flow shop scheduling with limited buffers using hybrid self-adaptive differential evolution"],"prefix":"10.1007","volume":"11","author":[{"given":"Jing","family":"Liang","sequence":"first","affiliation":[]},{"given":"Peng","family":"Wang","sequence":"additional","affiliation":[]},{"given":"Li","family":"Guo","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7539-3927","authenticated-orcid":false,"given":"Boyang","family":"Qu","sequence":"additional","affiliation":[]},{"given":"Caitong","family":"Yue","sequence":"additional","affiliation":[]},{"given":"Kunjie","family":"Yu","sequence":"additional","affiliation":[]},{"given":"Yachao","family":"Wang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,7,16]]},"reference":[{"issue":"6","key":"290_CR1","first-page":"77","volume":"2","author":"S Abdellah","year":"2014","unstructured":"Abdellah S, Rodriguez J (2014) Tailoring hyper-heuristics to specific instances of a scheduling problem using affinity and competence functions. Memet Comput 2(6):77\u201384","journal-title":"Memet Comput"},{"key":"290_CR2","doi-asserted-by":"crossref","unstructured":"Alhindi A, Zhang, Q (2014) MOEA\/D with tabu search for multiobjective permutation flow shop scheduling problems. In: IEEE congress on evolutionary computation, pp 1155\u20131164","DOI":"10.1109\/CEC.2014.6900413"},{"issue":"4","key":"290_CR3","doi-asserted-by":"publisher","first-page":"549","DOI":"10.1007\/s00291-003-0133-7","volume":"25","author":"P Brucker","year":"2003","unstructured":"Brucker P, Heitmann S, Hurink J (2003) Flow-shop problems with intermediate buffers. OR Spectr 25(4):549\u2013574","journal-title":"OR Spectr"},{"issue":"1","key":"290_CR4","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1002\/(SICI)1099-1360(199801)7:1<34::AID-MCDA161>3.0.CO;2-6","volume":"7","author":"P Czyzzak","year":"2015","unstructured":"Czyzzak P, Jaszkiewicz A (2015) Pareto simulated annealinga metaheuristic technique for multiple-objective combinatorial optimization. J Multi-Criteria Decis Anal 7(1):34\u201347","journal-title":"J Multi-Criteria Decis Anal"},{"issue":"3","key":"290_CR5","doi-asserted-by":"publisher","first-page":"817","DOI":"10.1016\/j.ejor.2018.08.048","volume":"273","author":"W Li","year":"2019","unstructured":"Li W, Nault B, Ye H (2019) Trade-off balancing in scheduling for flow shop production and perioperative processes. Eur J Oper Res 273(3):817\u2013830","journal-title":"Eur J Oper Res"},{"issue":"99","key":"290_CR6","first-page":"1","volume":"1","author":"Y Han","year":"2017","unstructured":"Han Y, Gong D, Jin Y, Pan Q (2017) Evolutionary multiobjective blocking lot-streaming flow shop scheduling with machine breakdowns. IEEE Trans Cybern 1(99):1\u201314","journal-title":"IEEE Trans Cybern"},{"issue":"1\u20134","key":"290_CR7","doi-asserted-by":"publisher","first-page":"397","DOI":"10.1007\/s00170-012-4493-5","volume":"67","author":"Y Han","year":"2013","unstructured":"Han Y, Liang J, Pan Q, Li J, Sang H, Cao N (2013) Effective hybrid discrete artificial bee colony algorithms for the total flowtime minimization in the blocking flowshop problem. Int J Adv Manuf Technol 67(1\u20134):397\u2013414","journal-title":"Int J Adv Manuf Technol"},{"key":"290_CR8","doi-asserted-by":"publisher","first-page":"428","DOI":"10.1016\/j.asoc.2018.02.010","volume":"66","author":"A Khan","year":"2018","unstructured":"Khan A, Christian N (2018) A differential evolution based approach for the production scheduling of open pit mines with or without the condition of grade uncertainty. Appl Soft Comput J 66:428\u2013437","journal-title":"Appl Soft Comput J"},{"issue":"28","key":"290_CR9","doi-asserted-by":"publisher","first-page":"2085","DOI":"10.1080\/00207549008942855","volume":"11","author":"R Leisten","year":"1990","unstructured":"Leisten R (1990) Flowshop sequencing problems with limited buffer storage. Int J Prod Res 11(28):2085\u20132100","journal-title":"Int J Prod Res"},{"key":"290_CR10","doi-asserted-by":"publisher","first-page":"487","DOI":"10.1016\/j.ins.2014.10.009","volume":"316","author":"J Li","year":"2015","unstructured":"Li J, Pan Q (2015) Solving the large-scale hybrid flow shop scheduling problem with limited buffers by a hybrid artificial bee colony algorithm. Inf Sci 316:487\u2013502","journal-title":"Inf Sci"},{"key":"290_CR11","doi-asserted-by":"publisher","unstructured":"Liang J, Wang P, Yue C, Yu K, Li Z, Qu B (2018) Multi-objective brainstorm optimization algorithm for sparse optimization. In: IEEE congress on evolutionary computation. \n                    https:\/\/doi.org\/10.1109\/CEC.2018.8477789","DOI":"10.1109\/CEC.2018.8477789"},{"issue":"1","key":"290_CR12","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1109\/TSMCB.2006.883272","volume":"37","author":"B Liu","year":"2007","unstructured":"Liu B, Wang L, Jin Y (2007) An effective PSO-based memetic algorithm for flow shop scheduling. IEEE Trans Syst Man Cybern 37(1):18\u201327","journal-title":"IEEE Trans Syst Man Cybern"},{"issue":"1","key":"290_CR13","doi-asserted-by":"publisher","first-page":"42","DOI":"10.1016\/j.ejor.2003.08.029","volume":"161","author":"T Loukil","year":"2005","unstructured":"Loukil T, Teghemb J (2005) Solving multi-objective production scheduling problems using metaheuristics. Eur J Oper Res 161(1):42\u201361","journal-title":"Eur J Oper Res"},{"issue":"4","key":"290_CR14","doi-asserted-by":"publisher","first-page":"789","DOI":"10.1007\/s10845-015-1129-2","volume":"29","author":"J Mou","year":"2018","unstructured":"Mou J, Li X, Gao L, Yi W (2018) An effective L-MONG algorithm for solving multi-objective flow-shop inverse scheduling problems. J Intell Manuf 29(4):789\u2013807","journal-title":"J Intell Manuf"},{"issue":"1","key":"290_CR15","doi-asserted-by":"publisher","first-page":"394","DOI":"10.1016\/j.cor.2010.06.007","volume":"38","author":"Q Pan","year":"2011","unstructured":"Pan Q, Suganthan P, Wang L, Gao L, Mallipeddi R (2011) A differential evolution algorithm with self-adapting strategy and control parameters. Comput Oper Res 38(1):394\u2013408","journal-title":"Comput Oper Res"},{"key":"290_CR16","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1016\/j.cie.2018.05.056","volume":"122","author":"K Peng","year":"2018","unstructured":"Peng K, Pan Q, Gao L, Zhang B, Pang X (2018) An improved artificial bee colony algorithm for real-world hybrid flowshop rescheduling in steelmaking-refining-continuous casting process. Comput Ind Eng 122:235\u2013250","journal-title":"Comput Ind Eng"},{"issue":"10","key":"290_CR17","first-page":"2960","volume":"33","author":"B Qian","year":"2009","unstructured":"Qian B, Wang L, Huang D, Wang X (2009) An effective hybrid DE-based algorithm for multi-objective flow shop scheduling with limited buffers. Comput Oper Res 33(10):2960\u20132971","journal-title":"Comput Oper Res"},{"issue":"2","key":"290_CR18","doi-asserted-by":"publisher","first-page":"398","DOI":"10.1109\/TEVC.2008.927706","volume":"13","author":"A Qin","year":"2009","unstructured":"Qin A, Huang V, Suganthan P (2009) Differential evolution algorithm with strategy adaptation for global numerical optimization. IEEE Trans Evol Comput 13(2):398\u2013417","journal-title":"IEEE Trans Evol Comput"},{"issue":"5","key":"290_CR19","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1016\/j.coastaleng.2004.04.003","volume":"51","author":"C Soares","year":"2004","unstructured":"Soares C, Scotto M (2004) Application of the $$r$$ largest-order statistics for long-term predictions of significant wave height. Coast Eng 51(5):387\u2013394","journal-title":"Coast Eng"},{"issue":"11","key":"290_CR20","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1023\/A:1008202821328","volume":"4","author":"R Storn","year":"1997","unstructured":"Storn R, Price K (1997) Differential evolution: a simple and efficient heuristic for global optimization over continuous spaces. J Global Optim 4(11):341\u2013359","journal-title":"J Global Optim"},{"issue":"3","key":"290_CR21","doi-asserted-by":"publisher","first-page":"617","DOI":"10.1007\/s10845-015-1046-4","volume":"29","author":"Q Ta","year":"2018","unstructured":"Ta Q, Billaut J, Bouquard J (2018) Matheuristic algorithms for minimizing total tardiness in the $$m$$-machine flow-shop scheduling problem. J Intell Manuf 29(3):617\u2013628","journal-title":"J Intell Manuf"},{"issue":"5","key":"290_CR22","first-page":"682","volume":"20","author":"M Tasgetiren","year":"2004","unstructured":"Tasgetiren M, Liang Y, Sevkli M, Gencyilmaz G (2004) Differential evolution algorithm for permutation flowshop sequencing problem with makespan criterion. IEEE Trans Cybern 20(5):682\u2013694","journal-title":"IEEE Trans Cybern"},{"issue":"1","key":"290_CR23","first-page":"57","volume":"38","author":"E Vallada","year":"2010","unstructured":"Vallada E, Ruiz R (2010) Genetic algorithms with path relinking for the minimum tardiness permutation flowshop problem. Int J Manag Sci 38(1):57\u201367","journal-title":"Int J Manag Sci"},{"issue":"127","key":"290_CR24","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1016\/j.neucom.2013.06.043","volume":"127","author":"S Venske","year":"2014","unstructured":"Venske S, Gon AR, Delgado M (2014) ADEMO\/D: multi-objective optimization by an adaptive differential evolution algorithm. Neurocomputing 127(127):65\u201377","journal-title":"Neurocomputing"},{"issue":"3","key":"290_CR25","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1007\/s00500-008-0394-9","volume":"14","author":"Y Wang","year":"2010","unstructured":"Wang Y, Wu L, Yuan X (2010) Multi-objective self-adaptive differential evolution with elitist archive and crowding entropy-based diversity measure. Soft Comput 14(3):193\u2013209","journal-title":"Soft Comput"},{"issue":"6","key":"290_CR26","doi-asserted-by":"publisher","first-page":"616","DOI":"10.1080\/0951192X.2016.1187301","volume":"30","author":"F Zhao","year":"2016","unstructured":"Zhao F, Chen Z, Wang L, Zhang C (2016) An improved MOEA\/D for multi-objective job shop scheduling problem. Int J Comput Integr Manuf 30(6):616\u2013640","journal-title":"Int J Comput Integr Manuf"},{"issue":"4","key":"290_CR27","first-page":"231","volume":"3","author":"K Ziad","year":"2012","unstructured":"Ziad K, Raeesi M (2012) A memetic algorithm for job shop scheduling using a critical-path-based local search heuristic. Memet Comput 3(4):231\u2013245","journal-title":"Memet Comput"},{"key":"290_CR28","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1016\/j.knosys.2018.02.029","volume":"148","author":"D Gong","year":"2018","unstructured":"Gong D, Han Y, Jin Y (2018) A novel hybrid multi-objective artificial bee colony algorithm for the blocking lot-streaming flow shop scheduling problems. Knowl Based Syst 148:115\u2013130","journal-title":"Knowl Based Syst"},{"issue":"1","key":"290_CR29","doi-asserted-by":"publisher","first-page":"5946","DOI":"10.1109\/ACCESS.2018.2889373","volume":"7","author":"Y Han","year":"2019","unstructured":"Han Y, Li J, Gong D (2019) Multi-objective migrating birds optimization algorithm for stochastic lot-streaming flow shop scheduling with blocking. IEEE Access 7(1):5946\u20135962","journal-title":"IEEE Access"}],"container-title":["Memetic Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12293-019-00290-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s12293-019-00290-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12293-019-00290-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,7,14]],"date-time":"2020-07-14T23:21:04Z","timestamp":1594768864000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s12293-019-00290-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,7,16]]},"references-count":29,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2019,12]]}},"alternative-id":["290"],"URL":"https:\/\/doi.org\/10.1007\/s12293-019-00290-5","relation":{},"ISSN":["1865-9284","1865-9292"],"issn-type":[{"value":"1865-9284","type":"print"},{"value":"1865-9292","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,7,16]]},"assertion":[{"value":"21 November 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 June 2019","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 July 2019","order":3,"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":"The work is supported by National Natural Science Foundation of China (61876169, 61673404, 61473266, and 61806179), Project supported by the Research Award Fund for Outstanding Young Teachers in Henan Provincial Institutions of Higher Education of China (2014GGJS-004 and 2016GGJS-094) and Program for Science & Technology Innovation Talents in Universities of Henan Province in China (16HASTIT041 and 16HASTIT033), Scientific and Technological Project of Henan Province (152102210153), China Postdoctoral Science Foundation(2017M622373).","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Funding"}}]}}