{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T02:08:52Z","timestamp":1750212532504,"version":"3.28.0"},"reference-count":37,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016,12]]},"DOI":"10.1109\/ssci.2016.7850041","type":"proceedings-article","created":{"date-parts":[[2017,2,16]],"date-time":"2017-02-16T22:24:33Z","timestamp":1487283873000},"page":"1-7","source":"Crossref","is-referenced-by-count":1,"title":["Scheduling of stochastic distributed assembly flowshop under complex constraints"],"prefix":"10.1109","author":[{"family":"Xiying Du","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mengchen","family":"Ji","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"family":"Zhengyang Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bo","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2015.2458037"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1007\/s40747-016-0011-y"},{"key":"ref31","article-title":"Multi-Objective Multifactorial Optimization in Evolutionary Multitasking","author":"gupta","year":"2016","journal-title":"IEEE Transactions on Cybernetics"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2015.01.010"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1287\/ijoc.6.2.154"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/MCI.2010.936311"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/TSMCB.2006.883267"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1007\/s12293-015-0166-x"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/CoDIT.2014.6996861"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1016\/j.ijpe.2015.07.027"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/CEC.2016.7744120"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1080\/00207543.2014.948578"},{"key":"ref14","first-page":"2618","article-title":"A general variable neighborhood search algorithm to minimize makespan of the distributed permutation flowshop scheduling problem","volume":"9","author":"komaki","year":"2015","journal-title":"World Academy of Science Engineering and Technology International Journal of Social Behavioral Educational Economic Business and Industrial Engineering"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1007\/11596448_93"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1007\/s00170-003-1961-y"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1007\/s00170-005-0277-5"},{"journal-title":"Scheduling Theory Algorithms and Systems","year":"2002","author":"pinedo","key":"ref18"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1057\/jors.1994.65"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2008.2009460"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/IESM.2015.7380142"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2003.819944"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1057\/jors.2015.50"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2015.11.034"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1007\/s12559-016-9395-7"},{"journal-title":"Best known solutions for Taillard's instances adapted to the distributed blocking flow shop scheduling problem","year":"2016","author":"ribas vila","key":"ref5"},{"key":"ref8","article-title":"A competitive memetic algorithm for multiobjective distributed permutation flow shop scheduling problem","author":"deng","year":"2016","journal-title":"Swarm and Evolutionary Computation"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1080\/00207543.2015.1084063"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1080\/00207543.2013.807955"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2009.06.019"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-42291-6_48"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1145\/62.65"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1287\/opre.44.3.510"},{"key":"ref21","first-page":"220","article-title":"No-wait shop scheduling: computational complexity and approximate algorithms","volume":"25","author":"goyal","year":"1988","journal-title":"Opsearch"},{"key":"ref24","doi-asserted-by":"crossref","DOI":"10.1093\/oso\/9780195131581.001.0001","author":"bonabeau","year":"1999","journal-title":"Swarm Intelligence From Natural to Artificial Systems"},{"journal-title":"Computers and Intractability A Guide to the Theory of NP-Completeness","year":"1979","author":"garey","key":"ref23"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1126\/science.220.4598.671"},{"journal-title":"Swarm Intelligence","year":"2001","author":"kennedy","key":"ref25"}],"event":{"name":"2016 IEEE Symposium Series on Computational Intelligence (SSCI)","start":{"date-parts":[[2016,12,6]]},"location":"Athens, Greece","end":{"date-parts":[[2016,12,9]]}},"container-title":["2016 IEEE Symposium Series on Computational Intelligence (SSCI)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/7840087\/7849361\/07850041.pdf?arnumber=7850041","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,24]],"date-time":"2022-07-24T09:27:54Z","timestamp":1658654874000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7850041\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,12]]},"references-count":37,"URL":"https:\/\/doi.org\/10.1109\/ssci.2016.7850041","relation":{},"subject":[],"published":{"date-parts":[[2016,12]]}}}