{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,23]],"date-time":"2024-10-23T06:34:04Z","timestamp":1729665244152,"version":"3.28.0"},"reference-count":15,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013,8]]},"DOI":"10.1109\/coase.2013.6653907","type":"proceedings-article","created":{"date-parts":[[2013,11,11]],"date-time":"2013-11-11T22:22:15Z","timestamp":1384208535000},"page":"1022-1027","source":"Crossref","is-referenced-by-count":4,"title":["A job-family-oriented algorithm for re-entrant batch processing machine scheduling"],"prefix":"10.1109","author":[{"given":"Wenyou","family":"Jia","sequence":"first","affiliation":[]},{"given":"Zhibin","family":"Jiang","sequence":"additional","affiliation":[]},{"given":"You","family":"Li","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"15","first-page":"20","article-title":"Sequencing with time delay costs","volume":"5","author":"montagne","year":"1969","journal-title":"Industrial Engineering Research Bulletin Arizona State University"},{"key":"13","doi-asserted-by":"publisher","DOI":"10.1287\/moor.15.3.483"},{"key":"14","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-5060(08)70742-8"},{"journal-title":"Complexity of machine scheduling problems","year":"1977","author":"lenstra","key":"11"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2011.06.003"},{"key":"3","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1080\/07408179808966448","article-title":"Minimizing total tardiness on a batch processing machine with incompatible job families","volume":"30","author":"mehta","year":"1998","journal-title":"IIE Transactions"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.1007\/s00170-005-2585-1"},{"key":"1","doi-asserted-by":"publisher","DOI":"10.1016\/S0377-2217(99)00153-8"},{"key":"10","doi-asserted-by":"publisher","DOI":"10.1002\/nav.3800030106"},{"key":"7","article-title":"Scheduling a production line to minimize maximum tardiness","author":"jackson","year":"1955","journal-title":"DTIC Document"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.1080\/00207540310001636994"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2004.04.001"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.1109\/COASE.2006.326933"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.1080\/00207549508904839"},{"journal-title":"Scheduling Theory Algorithms and Systems","year":"1995","author":"pinedo","key":"8"}],"event":{"name":"2013 IEEE International Conference on Automation Science and Engineering (CASE 2013)","start":{"date-parts":[[2013,8,17]]},"location":"Madison, WI, USA","end":{"date-parts":[[2013,8,20]]}},"container-title":["2013 IEEE International Conference on Automation Science and Engineering (CASE)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6639384\/6653883\/06653907.pdf?arnumber=6653907","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,22]],"date-time":"2017-06-22T01:45:56Z","timestamp":1498095956000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6653907\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,8]]},"references-count":15,"URL":"https:\/\/doi.org\/10.1109\/coase.2013.6653907","relation":{},"subject":[],"published":{"date-parts":[[2013,8]]}}}