{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T02:14:07Z","timestamp":1775009647413,"version":"3.50.1"},"reference-count":30,"publisher":"IEEE","license":[{"start":{"date-parts":[[2020,8,1]],"date-time":"2020-08-01T00:00:00Z","timestamp":1596240000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2020,8,1]],"date-time":"2020-08-01T00:00:00Z","timestamp":1596240000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2020,8,1]],"date-time":"2020-08-01T00:00:00Z","timestamp":1596240000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020,8]]},"DOI":"10.1109\/case48305.2020.9217021","type":"proceedings-article","created":{"date-parts":[[2020,10,8]],"date-time":"2020-10-08T20:01:51Z","timestamp":1602187311000},"page":"508-513","source":"Crossref","is-referenced-by-count":3,"title":["Solving scheduling problems for a non-permutation assembly flow shop"],"prefix":"10.1109","author":[{"given":"Qiunan","family":"Meng","sequence":"first","affiliation":[]},{"given":"Xun","family":"Xu","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref30","first-page":"1","article-title":"A constructive algorithm and a simulated annealing approach for solving flowshop problems with missing operations","author":"henneberg","year":"2015","journal-title":"Int J Prod Res"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2017.07.012"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2018.06.001"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1080\/00207543.2013.807955"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1080\/00207548808947920"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1016\/0167-6377(91)90014-G"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1016\/0098-1354(91)80014-M"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1007\/s00170-006-0492-8"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1017\/S0890060413000176"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1007\/s10845-012-0724-8"},{"key":"ref19","doi-asserted-by":"crossref","first-page":"349","DOI":"10.1017\/S0890060413000176","article-title":"Nonpermutation flow line scheduling by ant colony optimization","volume":"27","author":"andrea","year":"2013","journal-title":"AI EDAM-artificial intelligence for engineering design analysis and manufacturing"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/TASE.2020.2966738"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1016\/S0377-2217(97)00027-1"},{"key":"ref27","first-page":"1178","article-title":"Branch-and-price algorithm for rolling batch scheduling problem in continuous-casting and rolling processes with hybrid production mode","volume":"43","author":"wang","year":"2017","journal-title":"ACTA Automatica Sinica"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1002\/nav.3800010110"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1016\/S0925-5273(00)00169-9"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1057\/jors.2011.90"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.39.5.616"},{"key":"ref8","first-page":"109","article-title":"A hybrid tabu search heuristic for the two-stage assembly scheduling problem","volume":"2","author":"al-anzi","year":"2006","journal-title":"Int J Oper Res"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1016\/S0305-0548(01)00098-3"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2008.12.001"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1016\/j.ijpe.2007.12.007"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1287\/opre.43.2.346"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1016\/j.amc.2010.05.089"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1057\/palgrave.jors.2600793"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1016\/j.jmsy.2017.12.002"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1080\/002075498192896"},{"key":"ref23","article-title":"Introduction to Sequencing and Scheduling","author":"baker","year":"1974"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2012.02.024"},{"key":"ref25","doi-asserted-by":"crossref","first-page":"787","DOI":"10.1016\/j.ejor.2008.01.016","article-title":"A dynamic programming based heuristic for the assembly line balancing problem","volume":"194","author":"joaqu\u00edn","year":"2009","journal-title":"Eur J Oper Res"}],"event":{"name":"2020 IEEE 16th International Conference on Automation Science and Engineering (CASE)","location":"Hong Kong, Hong Kong","start":{"date-parts":[[2020,8,20]]},"end":{"date-parts":[[2020,8,21]]}},"container-title":["2020 IEEE 16th International Conference on Automation Science and Engineering (CASE)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9210430\/9216730\/09217021.pdf?arnumber=9217021","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,6,27]],"date-time":"2022-06-27T15:54:23Z","timestamp":1656345263000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9217021\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,8]]},"references-count":30,"URL":"https:\/\/doi.org\/10.1109\/case48305.2020.9217021","relation":{},"subject":[],"published":{"date-parts":[[2020,8]]}}}