{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T12:05:44Z","timestamp":1759665944610},"reference-count":13,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2006,9,20]],"date-time":"2006-09-20T00:00:00Z","timestamp":1158710400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2006,10,21]]},"DOI":"10.1007\/s10878-006-9003-y","type":"journal-article","created":{"date-parts":[[2006,10,8]],"date-time":"2006-10-08T10:38:14Z","timestamp":1160303894000},"page":"337-350","source":"Crossref","is-referenced-by-count":43,"title":["Scheduling with machine cost and rejection"],"prefix":"10.1007","volume":"12","author":[{"given":"Gy\u00f6rgy","family":"D\u00f3sa","sequence":"first","affiliation":[]},{"given":"Yong","family":"He","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2006,9,20]]},"reference":[{"key":"9003_CR1","doi-asserted-by":"crossref","first-page":"64","DOI":"10.1137\/S0895480196300522","volume":"13","author":"Y Bartal","year":"2001","unstructured":"Bartal Y, Leonardi S, Marchetti-Spaccamela A, Sgall J, Stougie L (2001) Multiprocessor scheduling with rejection. SIAM J Discrete Math 13:64\u201378","journal-title":"SIAM J Discrete Math"},{"key":"9003_CR2","doi-asserted-by":"crossref","first-page":"1035","DOI":"10.1137\/S009753970343395X","volume":"33","author":"G D\u00f3sa","year":"2004","unstructured":"D\u00f3sa G, He Y (2004) Better on-line algorithms for scheduling with machine cost. SIAM J Comput 33:1035\u20131051","journal-title":"SIAM J Comput"},{"issue":"1","key":"9003_CR3","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1007\/s00607-005-0130-6","volume":"76","author":"G D\u00f3sa","year":"2006","unstructured":"D\u00f3sa G, He Y (2006) Preemptive and non-preemptive on-line algorithms for scheduling with rejection on two uniform machines. Comput 76(1):149\u2013164","journal-title":"Comput"},{"key":"9003_CR4","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1007\/s00453-003-1077-7","volume":"39","author":"L Epstein","year":"2004","unstructured":"Epstein L, Sgall J (2004) Approximation schemes for scheduling on uniformly related and identical parallel machines. Algorithmica 39:43\u201357","journal-title":"Algorithmica"},{"key":"9003_CR5","doi-asserted-by":"crossref","first-page":"1563","DOI":"10.1002\/j.1538-7305.1966.tb01709.x","volume":"45","author":"RL Graham","year":"1966","unstructured":"Graham RL (1966) Bounds for certain multiprocessor anomalies. Bell Syst Techn J 45:1563\u20131581","journal-title":"Bell Syst Techn J"},{"key":"9003_CR6","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/PL00021409","volume":"65","author":"Y He","year":"2000","unstructured":"He Y, Min X (2000) On-line machine scheduling with rejection. Comput 65:1\u201312","journal-title":"Comput"},{"key":"9003_CR7","doi-asserted-by":"crossref","first-page":"361","DOI":"10.1007\/s10107-002-0324-z","volume":"94","author":"H Hoogeveen","year":"2003","unstructured":"Hoogeveen H, Skutella M, Woeginger GJ (2003) Preemptive scheduling with rejection. Math Program 94:361\u2013374","journal-title":"Math Program"},{"key":"9003_CR8","doi-asserted-by":"crossref","unstructured":"Imreh C, Noga J (1999) Scheduling with machine cost. In: Proc. RANDOM-APPROX Conf, lecture notes in computer science, vol. 1671, Springer-Verlag, pp 168\u2013176","DOI":"10.1007\/978-3-540-48413-4_18"},{"key":"9003_CR9","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1007\/s00236-004-0156-9","volume":"41","author":"YW Jiang","year":"2005","unstructured":"Jiang YW, He Y (2005) Preemptive online algorithms for scheduling with machine cost. Acta Informatica 41:315\u2013240","journal-title":"Acta Informatica"},{"key":"9003_CR10","doi-asserted-by":"crossref","unstructured":"Nagy-Gy\u00f6rgy J, Imreh C (2006) On-line scheduling with machine cost and rejection. Working paper","DOI":"10.1016\/j.dam.2007.07.004"},{"key":"9003_CR11","first-page":"509","volume":"34","author":"S Panwalker","year":"2002","unstructured":"Panwalker S, Liman SD (2002) Single operation earliness-tardiness scheduling with machine activation costs. IIE Trans 34:509\u2013513","journal-title":"IIE Trans"},{"key":"9003_CR12","unstructured":"Raghavan P (1991) A statistical adversary for on-line algorithms. In: On-line algorithms, DIMACS, Series in Discrete Mathematics and Theoretical Computer Sc., AMS, Providence, RI\/Assoc. for Comp. Mach. vol. 7, New York, pp. 79-83"},{"key":"9003_CR13","doi-asserted-by":"crossref","first-page":"437","DOI":"10.1016\/S0304-3975(00)00288-7","volume":"262","author":"S Seiden","year":"2001","unstructured":"Seiden S (2001) Preemptive multiprocessor scheduling with rejection. Theor Comput Sci 262:437\u2013458","journal-title":"Theor Comput Sci"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-006-9003-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-006-9003-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-006-9003-y","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,9]],"date-time":"2023-05-09T07:25:21Z","timestamp":1683617121000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-006-9003-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,9,20]]},"references-count":13,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2006,10,21]]}},"alternative-id":["9003"],"URL":"https:\/\/doi.org\/10.1007\/s10878-006-9003-y","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006,9,20]]}}}