{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,14]],"date-time":"2026-04-14T02:43:19Z","timestamp":1776134599118,"version":"3.50.1"},"reference-count":27,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2020,5,9]],"date-time":"2020-05-09T00:00:00Z","timestamp":1588982400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,5,9]],"date-time":"2020-05-09T00:00:00Z","timestamp":1588982400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["71701016"],"award-info":[{"award-number":["71701016"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["71471015"],"award-info":[{"award-number":["71471015"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004826","name":"Natural Science Foundation of Beijing Municipality","doi-asserted-by":"publisher","award":["9174038"],"award-info":[{"award-number":["9174038"]}],"id":[{"id":"10.13039\/501100004826","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Intell Manuf"],"published-print":{"date-parts":[[2021,2]]},"DOI":"10.1007\/s10845-020-01580-3","type":"journal-article","created":{"date-parts":[[2020,5,9]],"date-time":"2020-05-09T10:02:40Z","timestamp":1589018560000},"page":"427-439","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":50,"title":["A discrete differential evolution algorithm for flow shop group scheduling problem with sequence-dependent setup and transportation times"],"prefix":"10.1007","volume":"32","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-0662-2500","authenticated-orcid":false,"given":"Shuaipeng","family":"Yuan","sequence":"first","affiliation":[]},{"given":"Tieke","family":"Li","sequence":"additional","affiliation":[]},{"given":"Bailin","family":"Wang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,5,9]]},"reference":[{"issue":"3","key":"1580_CR1","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1016\/0895-7177(90)90368-w","volume":"13","author":"KR Baker","year":"1990","unstructured":"Baker, K. R. (1990). Scheduling groups of jobs in the two-machine flow shop. Mathematical and Computer Modelling, 13(3), 29\u201336. https:\/\/doi.org\/10.1016\/0895-7177(90)90368-w.","journal-title":"Mathematical and Computer Modelling"},{"issue":"12","key":"1580_CR2","doi-asserted-by":"publisher","first-page":"15517","DOI":"10.1016\/j.eswa.2011.06.008","volume":"38","author":"H-M Cheng","year":"2011","unstructured":"Cheng, H.-M., & Ying, K.-C. (2011). Minimizing makespan in a flow-line manufacturing cell with sequence dependent family setup times. Expert Systems with Applications, 38(12), 15517\u201315522.","journal-title":"Expert Systems with Applications"},{"issue":"6","key":"1580_CR3","doi-asserted-by":"publisher","first-page":"1269","DOI":"10.1007\/s10845-015-1049-1","volume":"28","author":"A Costa","year":"2017","unstructured":"Costa, A., Cappadonna, F. A., & Fichera, S. (2017). A hybrid genetic algorithm for minimizing makespan in a flow-shop sequence-dependent group scheduling problem. Journal of Intelligent Manufacturing, 28(6), 1269\u20131283.","journal-title":"Journal of Intelligent Manufacturing"},{"key":"1580_CR4","doi-asserted-by":"publisher","first-page":"103413","DOI":"10.1016\/j.engappai.2019.103413","volume":"89","author":"A Costa","year":"2020","unstructured":"Costa, A., Cappadonna, F., & Fichera, S. (2020). Minimizing makespan in a flow shop sequence dependent group scheduling problem with blocking constraint. Engineering Applications of Artificial Intelligence, 89, 103413.","journal-title":"Engineering Applications of Artificial Intelligence"},{"issue":"6","key":"1580_CR5","doi-asserted-by":"publisher","first-page":"1357","DOI":"10.1007\/s10845-015-1055-3","volume":"28","author":"D Dechampai","year":"2017","unstructured":"Dechampai, D., Tanwanichkul, L., Sethanan, K., & Pitakaso, R. (2017). A differential evolution algorithm for the capacitated VRP with flexibility of mixing pickup and delivery services and the maximum duration of a route in poultry industry. Journal of Intelligent Manufacturing, 28(6), 1357\u20131376.","journal-title":"Journal of Intelligent Manufacturing"},{"key":"1580_CR6","doi-asserted-by":"publisher","first-page":"218","DOI":"10.1016\/j.ress.2018.04.004","volume":"176","author":"H Feng","year":"2018","unstructured":"Feng, H., Xi, L., Xiao, L., Xia, T., & Pan, E. (2018). Imperfect preventive maintenance optimization for flexible flowshop manufacturing cells considering sequence-dependent group scheduling. Reliability Engineering and System Safety, 176, 218\u2013229.","journal-title":"Reliability Engineering and System Safety"},{"issue":"3","key":"1580_CR7","doi-asserted-by":"publisher","first-page":"491","DOI":"10.1016\/j.cie.2003.11.004","volume":"48","author":"PM Fran\u00e7a","year":"2005","unstructured":"Fran\u00e7a, P. M., Gupta, J. N., Mendes, A. S., Moscato, P., & Veltink, K. J. (2005). Evolutionary algorithms for scheduling a flowshop manufacturing cell with sequence dependent family setups. Computers and Industrial Engineering, 48(3), 491\u2013506.","journal-title":"Computers and Industrial Engineering"},{"issue":"16","key":"1580_CR8","doi-asserted-by":"publisher","first-page":"4683","DOI":"10.1080\/00207540903049407","volume":"48","author":"A Gnanavel Babu","year":"2010","unstructured":"Gnanavel Babu, A., Jerald, J., Noorul Haq, A., Muthu Luxmi, V., & Vigneswaralu, T. (2010). Scheduling of machines and automated guided vehicles in FMS using differential evolution. International Journal of Production Research, 48(16), 4683\u20134699.","journal-title":"International Journal of Production Research"},{"key":"1580_CR9","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.cie.2018.12.025","volume":"128","author":"S-W Lin","year":"2019","unstructured":"Lin, S.-W., & Ying, K.-C. (2019). Makespan optimization in a no-wait flowline manufacturing cell with sequence-dependent family setup times. Computers and Industrial Engineering, 128, 1\u20137.","journal-title":"Computers and Industrial Engineering"},{"key":"1580_CR10","doi-asserted-by":"publisher","first-page":"258","DOI":"10.1016\/j.ijpe.2015.10.002","volume":"170","author":"CD Liou","year":"2015","unstructured":"Liou, C. D., & Hsieh, Y. C. (2015). A hybrid algorithm for the multi-stage flow shop group scheduling with sequence-dependent setup and transportation times. International Journal of Production Economics, 170, 258\u2013267.","journal-title":"International Journal of Production Economics"},{"issue":"1","key":"1580_CR11","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1080\/00207721.2011.581396","volume":"44","author":"C-D Liou","year":"2013","unstructured":"Liou, C.-D., Hsieh, Y.-C., & Chen, Y.-Y. (2013). A new encoding scheme-based hybrid algorithm for minimising two-machine flow-shop group scheduling problem. International Journal of Systems Science, 44(1), 77\u201393.","journal-title":"International Journal of Systems Science"},{"key":"1580_CR12","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1016\/j.amc.2014.09.010","volume":"248","author":"Y Liu","year":"2014","unstructured":"Liu, Y., Yin, M., & Gu, W. (2014). An effective differential evolution algorithm for permutation flow shop scheduling problem. Applied Mathematics and Computation, 248, 143\u2013159.","journal-title":"Applied Mathematics and Computation"},{"issue":"1","key":"1580_CR13","doi-asserted-by":"publisher","first-page":"158","DOI":"10.1016\/j.cor.2004.07.004","volume":"33","author":"R Logendran","year":"2006","unstructured":"Logendran, R., Salmasi, N., & Sriskandarajah, C. (2006). Two-machine group scheduling problems in discrete parts manufacturing with sequence-dependent setups. Computers and Operations Research, 33(1), 158\u2013180.","journal-title":"Computers and Operations Research"},{"issue":"1","key":"1580_CR14","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1007\/s10845-011-0552-2","volume":"24","author":"S Marimuthu","year":"2013","unstructured":"Marimuthu, S., & Sait, A. N. (2013). Performance evaluation of proposed differential evolution and particle swarm optimization algorithms for scheduling m-machine flow shops with lot streaming. Journal of Intelligent Manufacturing, 24(1), 175\u2013191.","journal-title":"Journal of Intelligent Manufacturing"},{"issue":"3","key":"1580_CR15","doi-asserted-by":"publisher","first-page":"702","DOI":"10.1016\/j.ejor.2015.10.007","volume":"250","author":"Q-K Pan","year":"2016","unstructured":"Pan, Q.-K. (2016). An effective co-evolutionary artificial bee colony algorithm for steelmaking-continuous casting scheduling. European Journal of Operational Research, 250(3), 702\u2013714.","journal-title":"European Journal of Operational Research"},{"key":"1580_CR16","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.cie.2015.12.001","volume":"92","author":"H Qin","year":"2016","unstructured":"Qin, H., Zhang, Z.-H., & Bai, D. (2016). Permutation flowshop group scheduling with position-based learning effect. Computers and Industrial Engineering, 92, 1\u201315.","journal-title":"Computers and Industrial Engineering"},{"issue":"3","key":"1580_CR17","doi-asserted-by":"publisher","first-page":"781","DOI":"10.1016\/j.ejor.2004.06.038","volume":"169","author":"R Ruiz","year":"2006","unstructured":"Ruiz, R., & Maroto, C. (2006). A genetic algorithm for hybrid flowshops with sequence dependent setup times and machine eligibility. European Journal of Operational Research, 169(3), 781\u2013800.","journal-title":"European Journal of Operational Research"},{"issue":"1","key":"1580_CR18","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1016\/j.cor.2009.04.013","volume":"37","author":"N Salmasi","year":"2010","unstructured":"Salmasi, N., Logendran, R., & Skandari, M. R. (2010). Total flow time minimization in a flowshop sequence-dependent group scheduling problem. Computers and Operations Research, 37(1), 199\u2013212.","journal-title":"Computers and Operations Research"},{"issue":"2","key":"1580_CR19","doi-asserted-by":"publisher","first-page":"324","DOI":"10.1016\/S0377-2217(99)00387-2","volume":"125","author":"JE Schaller","year":"2000","unstructured":"Schaller, J. E., Gupta, J. N., & Vakharia, A. J. (2000). Scheduling a flowline manufacturing cell with sequence dependent family setup times. European Journal of Operational Research, 125(2), 324\u2013339.","journal-title":"European Journal of Operational Research"},{"issue":"3","key":"1580_CR20","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1016\/S0925-5273(03)00196-8","volume":"88","author":"M Solimanpur","year":"2004","unstructured":"Solimanpur, M., Vrat, P., & Shankar, R. (2004). A heuristic to minimize makespan of cell scheduling problem. International Journal of Production Economics, 88(3), 231\u2013241.","journal-title":"International Journal of Production Economics"},{"issue":"4","key":"1580_CR21","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1023\/A:1008202821328","volume":"11","author":"R Storn","year":"1997","unstructured":"Storn, R., & Price, K. (1997). Differential evolution\u2013a simple and efficient heuristic for global optimization over continuous spaces. Journal of Global Optimization, 11(4), 341\u2013359.","journal-title":"Journal of Global Optimization"},{"issue":"16","key":"1580_CR22","doi-asserted-by":"publisher","first-page":"5033","DOI":"10.1080\/00207543.2010.497781","volume":"49","author":"MF Tasgetiren","year":"2011","unstructured":"Tasgetiren, M. F., Pan, Q. K., Suganthan, P. N., & Chua, T. J. (2011). A differential evolution algorithm for the no-idle flowshop scheduling problem with total tardiness criterion. International Journal of Production Research, 49(16), 5033\u20135050.","journal-title":"International Journal of Production Research"},{"issue":"4","key":"1580_CR23","doi-asserted-by":"publisher","first-page":"739","DOI":"10.1007\/s10845-012-0716-8","volume":"25","author":"LWH Vincent","year":"2014","unstructured":"Vincent, L. W. H., Ponnambalam, S., & Kanagaraj, G. (2014). Differential evolution variants to schedule flexible assembly lines. Journal of Intelligent Manufacturing, 25(4), 739\u2013753.","journal-title":"Journal of Intelligent Manufacturing"},{"key":"1580_CR24","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.cie.2018.04.021","volume":"120","author":"B Wang","year":"2018","unstructured":"Wang, B., Huang, K., & Li, T. (2018). Permutation flowshop scheduling with time lag constraints and makespan criterion. Computers and Industrial Engineering, 120, 1\u201314.","journal-title":"Computers and Industrial Engineering"},{"issue":"3","key":"1580_CR25","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1080\/05695557908974469","volume":"11","author":"T Yoshida","year":"1979","unstructured":"Yoshida, T., & Hitomi, K. (1979). Optimal two-stage production scheduling with setup times separated. A I I E Transactions, 11(3), 261\u2013263. https:\/\/doi.org\/10.1080\/05695557908974469.","journal-title":"A I I E Transactions"},{"issue":"6","key":"1580_CR26","doi-asserted-by":"publisher","first-page":"979","DOI":"10.1007\/s10845-009-0374-7","volume":"22","author":"M Zandieh","year":"2011","unstructured":"Zandieh, M., & Karimi, N. (2011). An adaptive multi-population genetic algorithm to solve the multi-objective group scheduling problem in hybrid flexible flowshop with sequence-dependent setup times. Journal of Intelligent Manufacturing, 22(6), 979\u2013989.","journal-title":"Journal of Intelligent Manufacturing"},{"key":"1580_CR27","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1016\/j.cor.2018.04.009","volume":"96","author":"S Zhou","year":"2018","unstructured":"Zhou, S., Li, X., Du, N., Pang, Y., & Chen, H. (2018). A multi-objective differential evolution algorithm for parallel batch processing machine scheduling considering electricity consumption cost. Computers and Operations Research, 96, 55\u201368.","journal-title":"Computers and Operations Research"}],"container-title":["Journal of Intelligent Manufacturing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10845-020-01580-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10845-020-01580-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10845-020-01580-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,9]],"date-time":"2021-05-09T00:09:34Z","timestamp":1620518974000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10845-020-01580-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,5,9]]},"references-count":27,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2021,2]]}},"alternative-id":["1580"],"URL":"https:\/\/doi.org\/10.1007\/s10845-020-01580-3","relation":{},"ISSN":["0956-5515","1572-8145"],"issn-type":[{"value":"0956-5515","type":"print"},{"value":"1572-8145","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,5,9]]},"assertion":[{"value":"14 January 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 April 2020","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 May 2020","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}