{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,22]],"date-time":"2024-10-22T20:47:20Z","timestamp":1729630040905,"version":"3.28.0"},"reference-count":14,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013,8]]},"DOI":"10.1109\/coase.2013.6653966","type":"proceedings-article","created":{"date-parts":[[2013,11,11]],"date-time":"2013-11-11T22:22:15Z","timestamp":1384208535000},"page":"392-397","source":"Crossref","is-referenced-by-count":1,"title":["A heuristic algorithm for minimizing total absolute deviation from distinct due dates on a single machine"],"prefix":"10.1109","author":[{"given":"You","family":"Li","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhibin","family":"Jiang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wenyou","family":"Jia","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"13","doi-asserted-by":"publisher","DOI":"10.1080\/07408178708975418"},{"key":"14","doi-asserted-by":"publisher","DOI":"10.1016\/S0377-2217(99)00345-8"},{"key":"11","doi-asserted-by":"publisher","DOI":"10.1016\/0377-2217(91)90078-A"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.1016\/S0898-1221(99)00130-3"},{"key":"3","doi-asserted-by":"crossref","first-page":"330","DOI":"10.1287\/moor.13.2.330","article-title":"One-processor scheduling with symmetric earliness and tardiness penalties","volume":"13","author":"garey","year":"1988","journal-title":"Math Oper Res"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.1002\/(SICI)1520-6750(199606)43:4<573::AID-NAV9>3.0.CO;2-4"},{"key":"1","doi-asserted-by":"publisher","DOI":"10.1287\/opre.38.1.22"},{"key":"10","doi-asserted-by":"publisher","DOI":"10.1002\/1520-6750(199302)40:1<85::AID-NAV3220400106>3.0.CO;2-C"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2012.02.014"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.1016\/j.ijpe.2007.04.008"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2006.02.003"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.1007\/s00291-005-0013-4"},{"key":"9","article-title":"Algorithms for single machine scheduling problems minimizing tardiness and earliness","author":"yano","year":"1986","journal-title":"Technical Report 86-40 Dept"},{"journal-title":"Scheduling Theory Algorithms and Systems","year":"2008","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\/06653966.pdf?arnumber=6653966","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,22]],"date-time":"2017-06-22T01:45:58Z","timestamp":1498095958000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6653966\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,8]]},"references-count":14,"URL":"https:\/\/doi.org\/10.1109\/coase.2013.6653966","relation":{},"subject":[],"published":{"date-parts":[[2013,8]]}}}