{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,3]],"date-time":"2025-10-03T22:34:12Z","timestamp":1759530852001},"publisher-location":"Berlin, Heidelberg","reference-count":8,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540663294"},{"type":"electronic","value":"9783540484134"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1999]]},"DOI":"10.1007\/978-3-540-48413-4_18","type":"book-chapter","created":{"date-parts":[[2011,1,14]],"date-time":"2011-01-14T07:52:41Z","timestamp":1294991561000},"page":"168-176","source":"Crossref","is-referenced-by-count":23,"title":["Scheduling with Machine Cost"],"prefix":"10.1007","author":[{"given":"Csan\u00e1d","family":"Imreh","sequence":"first","affiliation":[]},{"given":"John","family":"Noga","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"18_CR1","doi-asserted-by":"crossref","unstructured":"Albers, S.: Better bounds for online scheduling. In: Proc. 29th Symp. Theory of Computing, pp. 130\u2013139 (1997)","DOI":"10.1145\/258533.258566"},{"key":"18_CR2","unstructured":"Chekuri, C., Motwani, R., Natarajan, B., Stein, C.: Approximation techniques for average completion time scheduling. In: Proc. 8th Symp. On Discrete Algorithms, pp. 609\u2013618 (1997)"},{"key":"18_CR3","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1016\/0167-6377(94)90071-X","volume":"16","author":"B. Chen","year":"1994","unstructured":"Chen, B., van Vliet, A., Woeginger, G.J.: New lower and upper bounds for on-line scheduling. Operations Research Letters\u00a016, 221\u2013230 (1994)","journal-title":"Operations Research Letters"},{"key":"18_CR4","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1016\/S0167-6377(97)00040-0","volume":"21","author":"B. Chen","year":"1998","unstructured":"Chen, B., Vestjens, A.P.A.: Scheduling on identical machines: How good is LPT in an on-line setting? Operations Research Letters\u00a021, 165\u2013169 (1998)","journal-title":"Operations Research Letters"},{"key":"18_CR5","doi-asserted-by":"publisher","first-page":"349","DOI":"10.1137\/0222026","volume":"22","author":"G. Galambos","year":"1993","unstructured":"Galambos, G., Woeginger, G.J.: An on-line scheduling heuristic with better worst case ratio than Graham\u2019s list scheduling. SIAM Journal on Computing\u00a022, 349\u2013355 (1993)","journal-title":"SIAM Journal on Computing"},{"key":"18_CR6","doi-asserted-by":"crossref","first-page":"1563","DOI":"10.1002\/j.1538-7305.1966.tb01709.x","volume":"45","author":"R.L. Graham","year":"1966","unstructured":"Graham, R.L.: Bounds for certain multiprocessing anomalies. Bell System Technical Journal\u00a045, 1563\u20131581 (1966)","journal-title":"Bell System Technical Journal"},{"key":"18_CR7","doi-asserted-by":"crossref","unstructured":"Noga, J., Seiden, S.: Scheduling two machines with release times. To appear at Integer Programming and Combinatorial Optimization (1999)","DOI":"10.1007\/3-540-48777-8_29"},{"key":"18_CR8","doi-asserted-by":"publisher","first-page":"1313","DOI":"10.1137\/S0097539793248317","volume":"24","author":"D.B. Shmoys","year":"1995","unstructured":"Shmoys, D.B., Wein, J., Williamson, D.P.: Scheduling parallel machines on-line. SIAM Journal on Computing\u00a024, 1313\u20131331 (1995)","journal-title":"SIAM Journal on Computing"}],"container-title":["Lecture Notes in Computer Science","Randomization, Approximation, and Combinatorial Optimization. Algorithms and Techniques"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-48413-4_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,7]],"date-time":"2019-06-07T17:19:19Z","timestamp":1559927959000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-48413-4_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999]]},"ISBN":["9783540663294","9783540484134"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-48413-4_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1999]]}}}