{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,16]],"date-time":"2026-02-16T10:08:57Z","timestamp":1771236537318,"version":"3.50.1"},"reference-count":11,"publisher":"IEEE","license":[{"start":{"date-parts":[[2019,10,1]],"date-time":"2019-10-01T00:00:00Z","timestamp":1569888000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2019,10,1]],"date-time":"2019-10-01T00:00:00Z","timestamp":1569888000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2019,10,1]],"date-time":"2019-10-01T00:00:00Z","timestamp":1569888000000},"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":[[2019,10]]},"DOI":"10.1109\/kse.2019.8919323","type":"proceedings-article","created":{"date-parts":[[2019,12,6]],"date-time":"2019-12-06T05:26:17Z","timestamp":1575609977000},"page":"1-5","source":"Crossref","is-referenced-by-count":4,"title":["On The Capacitated Scheduling Problem with Conflict Jobs"],"prefix":"10.1109","author":[{"given":"Minh Hoang","family":"Ha","sequence":"first","affiliation":[]},{"given":"Duy Manh","family":"Vu","sequence":"additional","affiliation":[]},{"given":"Yakov","family":"Zinder","sequence":"additional","affiliation":[]},{"given":"Trung","family":"Thanh","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(95)00057-4"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1007\/s10951-008-0089-1"},{"key":"ref10","first-page":"627","article-title":"Clique is hard to approximate within n 1??","author":"h\u00e5stad","year":"1996","journal-title":"Proceedings of the 37th Annual Symposium on Foundations of Computer Science FOCS"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-55121-2_9"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.4153\/CJM-1965-045-4"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2008.04.016"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1016\/S0890-5401(02)00028-7"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-57182-5_21"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(96)00031-X"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-04565-7"},{"key":"ref1","author":"garey","year":"1979","journal-title":"Computers and Intractability A Guide to the Theory of NP-Completeness"}],"event":{"name":"2019 11th International Conference on Knowledge and Systems Engineering (KSE)","location":"Da Nang, Vietnam","start":{"date-parts":[[2019,10,24]]},"end":{"date-parts":[[2019,10,26]]}},"container-title":["2019 11th International Conference on Knowledge and Systems Engineering (KSE)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8909968\/8919259\/08919323.pdf?arnumber=8919323","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,14]],"date-time":"2022-07-14T23:20:09Z","timestamp":1657840809000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8919323\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,10]]},"references-count":11,"URL":"https:\/\/doi.org\/10.1109\/kse.2019.8919323","relation":{},"subject":[],"published":{"date-parts":[[2019,10]]}}}