{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,17]],"date-time":"2025-10-17T14:02:42Z","timestamp":1760709762069,"version":"3.37.3"},"reference-count":22,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/OAPA.html"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61473073","61104074"],"award-info":[{"award-number":["61473073","61104074"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100012226","name":"Fundamental Research Funds for the Central Universities","doi-asserted-by":"crossref","award":["N161702001","N171706003"],"award-info":[{"award-number":["N161702001","N171706003"]}],"id":[{"id":"10.13039\/501100012226","id-type":"DOI","asserted-by":"crossref"}]},{"name":"Program for Liaoning Excellent Talents in University","award":["LJQ2014028"],"award-info":[{"award-number":["LJQ2014028"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2018]]},"DOI":"10.1109\/access.2018.2881960","type":"journal-article","created":{"date-parts":[[2018,11,20]],"date-time":"2018-11-20T19:56:26Z","timestamp":1542743786000},"page":"72179-72188","source":"Crossref","is-referenced-by-count":2,"title":["Blocking Flowshop Scheduling Model for Optimising Cubic Criterion With Release Dates"],"prefix":"10.1109","volume":"6","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-0087-1730","authenticated-orcid":false,"given":"Tao","family":"Ren","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7209-3483","authenticated-orcid":false,"given":"Jie","family":"Liang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yi-Yang","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yao","family":"Fu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiao-Zhi","family":"Cui","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Qi-Bo","family":"Hu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1016\/j.omega.2011.06.002"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1016\/S0925-5273(99)00104-8"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/CCDC.2011.5968558"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1016\/j.omega.2010.07.007"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2010.04.042"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2011.02.013"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2013.02.003"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2015.04.013"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1080\/00207543.2016.1177671"},{"key":"ref19","doi-asserted-by":"crossref","first-page":"755","DOI":"10.1007\/s00170-010-3111-7","article-title":"Solving the blocking flow shop scheduling problem by a dynamic multi-swarm particle swarm optimizer","volume":"55","author":"liang","year":"2011","journal-title":"Int J Adv Manuf Technol"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1142\/S1469026803001105"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1057\/palgrave.jors.2601245"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1287\/opre.44.3.510"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2018.2834954"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2016.2565622"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2017.2769100"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1111\/j.1475-3995.2000.tb00207.x"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1080\/0305215X.2013.858139"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1007\/s10479-005-2444-3"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1016\/j.omega.2005.07.004"},{"key":"ref22","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4614-2361-4","author":"pinedo","year":"2012","journal-title":"Scheduling Theory Algorithms and Systems"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2017.01.006"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6287639\/8274985\/08540812.pdf?arnumber=8540812","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,7]],"date-time":"2023-09-07T10:01:01Z","timestamp":1694080861000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8540812\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"references-count":22,"URL":"https:\/\/doi.org\/10.1109\/access.2018.2881960","relation":{},"ISSN":["2169-3536"],"issn-type":[{"type":"electronic","value":"2169-3536"}],"subject":[],"published":{"date-parts":[[2018]]}}}