{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T13:37:42Z","timestamp":1725543462797},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540357537"},{"type":"electronic","value":"9783540357551"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11785293_13","type":"book-chapter","created":{"date-parts":[[2006,6,26]],"date-time":"2006-06-26T05:24:10Z","timestamp":1151299450000},"page":"113-123","source":"Crossref","is-referenced-by-count":4,"title":["Online, Non-preemptive Scheduling of Equal-Length Jobs on Two Identical Machines"],"prefix":"10.1007","author":[{"given":"Michael H.","family":"Goldwasser","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mark","family":"Pedigo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"2","key":"13_CR1","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1007\/s10288-003-0024-4","volume":"2","author":"P. Baptiste","year":"2004","unstructured":"Baptiste, P., Brucker, P., Knust, S., Timkovsky, V.G.: Ten notes on equal-processing-time scheduling. 4OR: Quarterly J. Belgian, French and Italian Operations Research Societies\u00a02(2), 111\u2013127 (2004)","journal-title":"4OR: Quarterly J. Belgian, French and Italian Operations Research Societies"},{"key":"13_CR2","first-page":"65","volume":"39","author":"S.K. Baruah","year":"2001","unstructured":"Baruah, S.K., Haritsa, J.R., Sharma, N.: On-line scheduling to maximize task completions. J.\u00a0Combin. Math. and Combin. Computing\u00a039, 65\u201378 (2001)","journal-title":"J.\u00a0Combin. Math. and Combin. Computing"},{"key":"13_CR3","volume-title":"Online Computation and Competitive Analysis","author":"A. Borodin","year":"1998","unstructured":"Borodin, A., El-Yaniv, R.: Online Computation and Competitive Analysis. Cambridge University Press, New York (1998)"},{"key":"13_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"358","DOI":"10.1007\/978-3-540-27836-8_32","volume-title":"Automata, Languages and Programming","author":"M. Chrobak","year":"2004","unstructured":"Chrobak, M., Jawor, W., Sgall, J., Tich\u00fd, T.: Online scheduling of equal-length jobs: Randomization and restarts help. In: D\u00edaz, J., Karhum\u00e4ki, J., Lepist\u00f6, A., Sannella, D. (eds.) ICALP 2004. LNCS, vol.\u00a03142, pp. 358\u2013370. Springer, Heidelberg (2004)"},{"key":"13_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1007\/11775096_5","volume-title":"Algorithmic Aspects in Information and Management","author":"J. Ding","year":"2006","unstructured":"Ding, J., Zhang, G.: Online scheduling with hard deadlines on parallel machines. In: Cheng, S.-W., Poon, C.K. (eds.) AAIM 2006. LNCS, vol.\u00a04041, pp. 32\u201342. Springer, Heidelberg (2006)"},{"issue":"2","key":"13_CR6","doi-asserted-by":"publisher","first-page":"370","DOI":"10.1006\/jagm.1999.1060","volume":"34","author":"S. Goldman","year":"2000","unstructured":"Goldman, S., Parwatikar, J., Suri, S.: On-line scheduling with hard deadlines. J.\u00a0Algorithms\u00a034(2), 370\u2013389 (2000)","journal-title":"J.\u00a0Algorithms"},{"issue":"2","key":"13_CR7","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1023\/A:1022994010777","volume":"6","author":"M.H. Goldwasser","year":"2003","unstructured":"Goldwasser, M.H.: Patience is a virtue: The effect of slack on competitiveness for admission control. J.\u00a0Scheduling\u00a06(2), 183\u2013211 (2003)","journal-title":"J.\u00a0Scheduling"},{"issue":"3","key":"13_CR8","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1023\/A:1022956425198","volume":"6","author":"M.H. Goldwasser","year":"2003","unstructured":"Goldwasser, M.H., Kerbikov, B.: Admission control with immediate notification. J.\u00a0Scheduling\u00a06(3), 269\u2013285 (2003)","journal-title":"J.\u00a0Scheduling"},{"key":"13_CR9","unstructured":"Jackson, J.R.: Scheduling a production line to minimize maximum tardiness. Research Report\u00a043, Management Science Research Project, University of California, Los Angeles (January 1955)"},{"key":"13_CR10","doi-asserted-by":"publisher","first-page":"294","DOI":"10.1137\/0212018","volume":"12","author":"B.B. Simons","year":"1983","unstructured":"Simons, B.B.: Multiprocessor scheduling of unit length jobs with arbitrary release times and deadlines. SIAM J. Comput.\u00a012, 294\u2013299 (1983)","journal-title":"SIAM J. Comput."},{"issue":"4","key":"13_CR11","doi-asserted-by":"publisher","first-page":"690","DOI":"10.1137\/0218048","volume":"18","author":"B.B. Simons","year":"1989","unstructured":"Simons, B.B., Warmuth, M.K.: A fast algorithm for multiprocessor scheduling of unit-length jobs. SIAM J. Comput.\u00a018(4), 690\u2013710 (1989)","journal-title":"SIAM J. Comput."}],"container-title":["Lecture Notes in Computer Science","Algorithm Theory \u2013 SWAT 2006"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11785293_13.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T07:19:12Z","timestamp":1619507952000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11785293_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540357537","9783540357551"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/11785293_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}