{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,4,2]],"date-time":"2023-04-02T20:29:54Z","timestamp":1680467394432},"reference-count":14,"publisher":"Elsevier BV","issue":"9","license":[{"start":{"date-parts":[[2009,5,1]],"date-time":"2009-05-01T00:00:00Z","timestamp":1241136000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":1538,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[2009,5]]},"DOI":"10.1016\/j.dam.2007.10.014","type":"journal-article","created":{"date-parts":[[2008,2,22]],"date-time":"2008-02-22T16:46:19Z","timestamp":1203698779000},"page":"2070-2077","source":"Crossref","is-referenced-by-count":14,"title":["Online scheduling with general machine cost functions"],"prefix":"10.1016","volume":"157","author":[{"given":"Cs.","family":"Imreh","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.dam.2007.10.014_b1","doi-asserted-by":"crossref","first-page":"486","DOI":"10.1145\/258128.258201","article-title":"On-line load balancing with applications to machine scheduling and virtual circuit routing","volume":"44","author":"Aspnes","year":"1997","journal-title":"Journal of the ACM"},{"key":"10.1016\/j.dam.2007.10.014_b2","doi-asserted-by":"crossref","unstructured":"P. Berman, M. Charikar, M. Karpinski, On-line load balancing for related machines, in: Proceedings of WADS 1997, 1997, pp. 116\u2013125","DOI":"10.1007\/3-540-63307-3_52"},{"key":"10.1016\/j.dam.2007.10.014_b3","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1137\/0209007","article-title":"Bounds for list schedules on uniform processors","volume":"9","author":"Cho","year":"1980","journal-title":"SIAM Journal on Computing"},{"key":"10.1016\/j.dam.2007.10.014_b4","doi-asserted-by":"crossref","unstructured":"J. Csirik, Cs. Imreh, J. Noga, S.S. Seiden, G. Woeginger, Buying a constant competitive ratio for paging, in: Proceedings of ESA 2001, 2001, pp. 98\u2013108","DOI":"10.1007\/3-540-44676-1_8"},{"issue":"5","key":"10.1016\/j.dam.2007.10.014_b5","doi-asserted-by":"crossref","first-page":"1035","DOI":"10.1137\/S009753970343395X","article-title":"Better online algorithms for scheduling with machine cost","volume":"33","author":"D\u00f3sa","year":"2004","journal-title":"SIAM Journal on Computing"},{"issue":"4","key":"10.1016\/j.dam.2007.10.014_b6","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1007\/s10878-006-9003-y","article-title":"Scheduling with machine cost and rejection","volume":"12","author":"D\u00f3sa","year":"2006","journal-title":"Journal of Combinatorial Optimization"},{"key":"10.1016\/j.dam.2007.10.014_b7","doi-asserted-by":"crossref","first-page":"1563","DOI":"10.1002\/j.1538-7305.1966.tb01709.x","article-title":"Bounds for certain multiprocessor anomalies","volume":"45","author":"Graham","year":"1966","journal-title":"Bell System Technical Journal"},{"issue":"6","key":"10.1016\/j.dam.2007.10.014_b8","doi-asserted-by":"crossref","first-page":"781","DOI":"10.1007\/BF02960768","article-title":"Semi-online scheduling with machine cost","volume":"17","author":"He","year":"2002","journal-title":"Journal of Computer Science and Technology"},{"key":"10.1016\/j.dam.2007.10.014_b9","doi-asserted-by":"crossref","unstructured":"Cs. Imreh, J. Noga, Scheduling with machine cost, in: Proceedings of APPROX99, 1999, pp. 168\u2013176","DOI":"10.1007\/978-3-540-48413-4_18"},{"key":"10.1016\/j.dam.2007.10.014_b10","first-page":"163","article-title":"Online scheduling on a two layer multiprocessor architecture","volume":"15","author":"Imreh","year":"2001","journal-title":"Acta Cybernetica"},{"key":"10.1016\/j.dam.2007.10.014_b11","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1007\/s00607-003-0011-9","article-title":"Scheduling problems on two sets of identical machines","volume":"70","author":"Imreh","year":"2003","journal-title":"Computing"},{"key":"10.1016\/j.dam.2007.10.014_b12","doi-asserted-by":"crossref","first-page":"2546","DOI":"10.1016\/j.dam.2007.07.004","article-title":"On-line scheduling with machine cost and rejection","volume":"155","author":"Nagy-Gy\u00f6rgy","year":"2007","journal-title":"Discrete Applied Mathematics"},{"key":"10.1016\/j.dam.2007.10.014_b13","doi-asserted-by":"crossref","unstructured":"S.S. Seiden, A guessing game and randomized online algorithms, in: Proceedings of STOC 2000, 2000, pp. 592\u2013601","DOI":"10.1145\/335305.335385"},{"key":"10.1016\/j.dam.2007.10.014_b14","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1007\/s00236-004-0156-9","article-title":"Preemptive online algorithms for scheduling with machine cost","volume":"41","author":"Jiang","year":"2005","journal-title":"Acta Informatica"}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X07004830?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X07004830?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,5,8]],"date-time":"2019-05-08T07:04:26Z","timestamp":1557299066000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X07004830"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,5]]},"references-count":14,"journal-issue":{"issue":"9","published-print":{"date-parts":[[2009,5]]}},"alternative-id":["S0166218X07004830"],"URL":"https:\/\/doi.org\/10.1016\/j.dam.2007.10.014","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[2009,5]]}}}  <script>parent.window.postMessage('ixistenz.url:https://api.crossref.org/works/10.1016%2FJ.DAM.2007.10.014', '*'); </script> <div id='browserdiffcontainer' style='position: fixed; right: 10px; top: 10vh; min-width: 60px;  border: 1px solid white; background: rgb(251, 189, 0);; opacity: 0.9; font-family: helvetica, arial, sans serif;  font-size: 12px; z-index: 20001; padding-bottom: 20px;'><div onclick="toggle('browserdiffcontainerlist'); return false;" style='background: rgb(151, 89, 0);; color: white; '><strong>&nbsp; <span class='glyphicon glyphicon-minus'></span> NODES</strong></div><div id='browserdiffcontainerlist' style='padding-left: 10px; padding-right: 5px; max-height: 50vh; overflow: auto; '></div></div>
<script>
function toggle( divname ) {
  var x = document.getElementById( divname );
  if (x.style.display === 'none') {
    x.style.display = 'block';
  } else {
    x.style.display = 'none';
  }
} </script>