{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T17:56:42Z","timestamp":1725559002345},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540262244"},{"type":"electronic","value":"9783540324409"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11496199_20","type":"book-chapter","created":{"date-parts":[[2010,7,14]],"date-time":"2010-07-14T10:29:15Z","timestamp":1279103355000},"page":"172-182","source":"Crossref","is-referenced-by-count":1,"title":["Linear Time Algorithms for Parallel Machine Scheduling"],"prefix":"10.1007","author":[{"given":"Zhiyi","family":"Tan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yong","family":"He","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"20_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF02684446","volume":"61","author":"R.E. Burkard","year":"1998","unstructured":"Burkard, R.E., He, Y., Kellerer, H.: A linear compound algorithm for uniform machine scheduling. Computing\u00a061, 1\u20139 (1998)","journal-title":"Computing"},{"key":"20_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1137\/0207001","volume":"7","author":"E.G. Coffman","year":"1978","unstructured":"Coffman, E.G., Garey, M.R., Johnson, D.S.: An application of bin-packing to multiprocessor scheduling. SIAM Journal on Computing\u00a07, 1\u201317 (1978)","journal-title":"SIAM Journal on Computing"},{"key":"20_CR3","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 multiprocessor anomalies. Bell Systems Technical Journal\u00a045, 1563\u20131581 (1966)","journal-title":"Bell Systems Technical Journal"},{"key":"20_CR4","doi-asserted-by":"publisher","first-page":"416","DOI":"10.1137\/0117039","volume":"17","author":"R.L. Graham","year":"1969","unstructured":"Graham, R.L.: Bounds on multiprocessing timing anomalies. SIAM Journal on Applied Mathematics\u00a017, 416\u2013429 (1969)","journal-title":"SIAM Journal on Applied Mathematics"},{"key":"20_CR5","doi-asserted-by":"publisher","first-page":"593","DOI":"10.1002\/1520-6750(200010)47:7<593::AID-NAV4>3.0.CO;2-H","volume":"47","author":"Y. He","year":"2000","unstructured":"He, Y., Kellerer, H., Kotov, V.: Linear compound algorithms for the partitioning problem. Naval Research Logistics\u00a047, 593\u2013601 (2000)","journal-title":"Naval Research Logistics"},{"key":"20_CR6","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1631\/jzus.2002.0060","volume":"3","author":"Y. He","year":"2002","unstructured":"He, Y., Yang, Q.F., Tan, Z.Y., Yao, E.Y.: Algorithms for semi on-line multiprocessor scheduling. Journal of Zhejiang University Science\u00a03, 60\u201364 (2002)","journal-title":"Journal of Zhejiang University Science"},{"key":"20_CR7","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1007\/s006070050020","volume":"62","author":"Y. He","year":"1999","unstructured":"He, Y., Zhang, G.C.: Semi on-line scheduling on two identical machines. Computing\u00a062, 179\u2013187 (1999)","journal-title":"Computing"},{"key":"20_CR8","doi-asserted-by":"publisher","first-page":"144","DOI":"10.1145\/7531.7535","volume":"34","author":"D.S. Hochbaum","year":"1987","unstructured":"Hochbaum, D.S., Shmoys, E.L.: Using dual approximation algorithms for scheduling problems: Theoretical and practical results. Journal of the ACM\u00a034, 144\u2013162 (1987)","journal-title":"Journal of the ACM"},{"key":"20_CR9","doi-asserted-by":"publisher","first-page":"539","DOI":"10.1137\/0217033","volume":"17","author":"D.S. Hochbaum","year":"1988","unstructured":"Hochbaum, D.S., Shmoys, E.L.: A polynomial approximation scheme for scheduling on uniform processors: Using the dual approximation approach. SIAM J. on Computing\u00a017, 539\u2013551 (1988)","journal-title":"SIAM J. on Computing"},{"key":"20_CR10","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1016\/S0167-6377(98)00005-4","volume":"21","author":"H. Kellerer","year":"1997","unstructured":"Kellerer, H., Kotov, V., Speranza, M.G., Tuza, Z.: Semi on-line algorithms for the partition problem. Operations Research Letters\u00a021, 235\u2013242 (1997)","journal-title":"Operations Research Letters"},{"key":"20_CR11","doi-asserted-by":"publisher","first-page":"408","DOI":"10.1016\/S0167-6377(02)00164-5","volume":"30","author":"Z.Y. Tan","year":"2002","unstructured":"Tan, Z.Y., He, Y.: Semi-on-line problems on two identical machines with combined partial information. Operations Research Letters\u00a030, 408\u2013414 (2002)","journal-title":"Operations Research Letters"}],"container-title":["Lecture Notes in Computer Science","Algorithmic Applications in Management"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11496199_20.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T06:39:53Z","timestamp":1619505593000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11496199_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540262244","9783540324409"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/11496199_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}