{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T10:16:59Z","timestamp":1740133019952,"version":"3.37.3"},"reference-count":12,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"12","license":[{"start":{"date-parts":[[2017,12,1]],"date-time":"2017-12-01T00:00:00Z","timestamp":1512086400000},"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 Commun. Lett."],"published-print":{"date-parts":[[2017,12]]},"DOI":"10.1109\/lcomm.2017.2752714","type":"journal-article","created":{"date-parts":[[2017,9,20]],"date-time":"2017-09-20T18:09:35Z","timestamp":1505930975000},"page":"2698-2701","source":"Crossref","is-referenced-by-count":6,"title":["User Association and Scheduling With Hard Deadlines in Heterogeneous Cellular Networks"],"prefix":"10.1109","volume":"21","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3417-7704","authenticated-orcid":false,"given":"Zoubeir","family":"Mlika","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Elmahdi","family":"Driouch","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4409-9447","authenticated-orcid":false,"given":"Wessam","family":"Ajib","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2016.2611899"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2016.2551559"},{"journal-title":"Further Advancements for E-UTRA Physical Layer Aspects (Release 9)","year":"2010","key":"ref10"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2016.2544478"},{"journal-title":"Gurobi Optimizer Reference Manual","year":"2016","key":"ref11"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TWC.2017.2718504"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2016.2616342"},{"journal-title":"Scheduling Theory Algorithms and Systems","year":"2016","author":"pinedo","key":"ref8"},{"journal-title":"Computers and Intractability A Guide to the Theory of NP-Completeness","year":"1979","author":"garey","key":"ref7"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/COMST.2016.2516538"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539700382820"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2015.2416971"}],"container-title":["IEEE Communications Letters"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/4234\/8170462\/08047333.pdf?arnumber=8047333","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T16:25:12Z","timestamp":1642004712000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/8047333\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,12]]},"references-count":12,"journal-issue":{"issue":"12"},"URL":"https:\/\/doi.org\/10.1109\/lcomm.2017.2752714","relation":{},"ISSN":["1089-7798"],"issn-type":[{"type":"print","value":"1089-7798"}],"subject":[],"published":{"date-parts":[[2017,12]]}}}