{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T18:39:36Z","timestamp":1775068776955,"version":"3.50.1"},"reference-count":32,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"3","license":[{"start":{"date-parts":[[2018,8,1]],"date-time":"2018-08-01T00:00:00Z","timestamp":1533081600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Eng. Manage."],"published-print":{"date-parts":[[2018,8]]},"DOI":"10.1109\/tem.2017.2785774","type":"journal-article","created":{"date-parts":[[2018,2,8]],"date-time":"2018-02-08T19:10:53Z","timestamp":1518117053000},"page":"487-504","source":"Crossref","is-referenced-by-count":91,"title":["Flexible Assembly Job-Shop Scheduling With Sequence-Dependent Setup Times and Part Sharing in a Dynamic Environment: Constraint Programming Model, Mixed-Integer Programming Model, and Dispatching Rules"],"prefix":"10.1109","volume":"65","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-7098-1834","authenticated-orcid":false,"given":"Sicheng","family":"Zhang","sequence":"first","affiliation":[]},{"given":"Shouyang","family":"Wang","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-61551-2_97"},{"key":"ref31","first-page":"1021","article-title":"A particle swarm optimization-based algorithm for flexible assembly job shop scheduling problem\n with sequence dependent","volume":"21","author":"nourali","year":"2014","journal-title":"Sci Iranica Trans E Ind Eng"},{"key":"ref30","first-page":"2117","article-title":"Integrated process planning and scheduling in flexible assembly job shop environment with sequence dependent setup\n times","volume":"6","author":"nourali","year":"2012","journal-title":"Int Journal of Math Analysis"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2006.09.011"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1007\/s00170-007-0950-y"},{"key":"ref12","first-page":"66","article-title":"Better heuristics for a two-stage multi-machine assembly scheduling problem to minimize total\n completion time","volume":"9","author":"al-anzi","year":"2012","journal-title":"Int J Oper Res"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1016\/j.jmsy.2013.06.001"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2008.11.018"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1016\/j.advengsoft.2010.06.004"},{"key":"ref16","doi-asserted-by":"crossref","first-page":"481","DOI":"10.1007\/s00170-012-4343-5","article-title":"A discrete PSO for two-stage assembly\n scheduling problem","volume":"66","author":"tian","year":"2013","journal-title":"Int J Adv Manuf Technol"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TSMC.2015.2416127"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2003.09.016"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.5267\/j.ijiec.2011.09.003"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1080\/00207540903524490"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1023\/A:1008952024606"},{"key":"ref27","doi-asserted-by":"crossref","first-page":"1391","DOI":"10.1016\/j.asoc.2012.04.007","article-title":"A comparison of hybrid genetic algorithm and hybrid particle swarm optimization to minimize\n makespan for assembly job shop","volume":"13","author":"wong","year":"2013","journal-title":"Appl Soft Comput"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.34.3.391"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1080\/0951192X.2011.562543"},{"key":"ref29","doi-asserted-by":"crossref","first-page":"376","DOI":"10.1016\/j.sbspro.2015.03.234","article-title":"An\n investigation of order review\/release policies and dispatching rules for assembly job shops with multi objective\n criteria","volume":"189","author":"paul","year":"2015","journal-title":"Procedia Soc Behav Sci"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1504\/IJMR.2010.031630"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1287\/opre.43.2.346"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.39.5.616"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1080\/002075499190491"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2004.09.002"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1007\/s10845-007-0026-8"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/CEC.2016.7744120"},{"key":"ref22","first-page":"127","article-title":"Ant colony optimization for multilevel assembly job shop scheduling","volume":"6","author":"omkumar","year":"2008","journal-title":"International Journal of Applied Management and Technology"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2005.06.005"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1016\/j.rcim.2007.01.001"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1080\/002075498192922"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2008.11.017"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2009.04.002"}],"container-title":["IEEE Transactions on Engineering Management"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/17\/8412170\/08286967.pdf?arnumber=8286967","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,26]],"date-time":"2022-01-26T13:23:48Z","timestamp":1643203428000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8286967\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,8]]},"references-count":32,"journal-issue":{"issue":"3"},"URL":"https:\/\/doi.org\/10.1109\/tem.2017.2785774","relation":{},"ISSN":["0018-9391","1558-0040"],"issn-type":[{"value":"0018-9391","type":"print"},{"value":"1558-0040","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,8]]}}}