{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T21:09:06Z","timestamp":1725484146883},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540437925"},{"type":"electronic","value":"9783540480860"}],"license":[{"start":{"date-parts":[[2002,1,1]],"date-time":"2002-01-01T00:00:00Z","timestamp":1009843200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-48086-2_10","type":"book-chapter","created":{"date-parts":[[2007,5,28]],"date-time":"2007-05-28T02:54:50Z","timestamp":1180320890000},"page":"87-96","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Dedicated Scheduling of Biprocessor Tasks to Minimize Mean Flow Time"],"prefix":"10.1007","author":[{"given":"Krzysztof","family":"Giaro","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marek","family":"Kubale","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Micha\u0142","family":"Ma\u0142afiejski","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Konrad","family":"Piwakowski","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2002,6,6]]},"reference":[{"key":"10_CR1","doi-asserted-by":"publisher","first-page":"744","DOI":"10.1137\/0214054","volume":"14","author":"E.G. Coffman Jr.","year":"1985","unstructured":"Coffman, Jr., E.G., Garey, M.R., Johnson, D.S., LaPaugh, A.S.: Scheduling file transfers. SIAM J. Comput. 14 (1985) 744\u2013780","journal-title":"SIAM J. Comput."},{"key":"10_CR2","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1007\/s004930170002","volume":"21","author":"R. Cole","year":"2001","unstructured":"Cole, R., Ost, K., Schirra, S., Edge-coloring bipartite graphs in O(E logD) time. Combinatorica 21 (2001) 5\u201312","journal-title":"Combinatorica"},{"key":"10_CR3","doi-asserted-by":"publisher","first-page":"592","DOI":"10.1287\/opre.37.4.592","volume":"37","author":"G. Dobson","year":"1989","unstructured":"Dobson, G., Karmarkar, U.S.: Simultaneous resourse scheduling to minimize weighted flow times. Oper. Res. 37 (1989) 592\u2013600","journal-title":"Oper. Res."},{"key":"10_CR4","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1016\/0377-2217(96)00123-3","volume":"94","author":"M. Drozdowski","year":"1996","unstructured":"Drozdowski, M.: Scheduling multiprocessor tasks-An overview. Euro. J. Oper. Res. 94 (1996) 215\u2013230","journal-title":"Euro. J. Oper. Res."},{"key":"10_CR5","doi-asserted-by":"publisher","first-page":"571","DOI":"10.1016\/S0305-0548(99)00048-9","volume":"27","author":"M. Drozdowski","year":"2000","unstructured":"Drozdowski, M., Dell\u2019Olmo, P.: Scheduling multiprocessor tasks for mean flow time criterion. Comp. Oper. Res. 27 (2000) 571\u2013585","journal-title":"Comp. Oper. Res."},{"unstructured":"Gehringer, E.F., Siewiorek, D.P., Segall, Z.: Parallel Processing: The Cm* Experience. Digital Press, Bedford (1987)","key":"10_CR6"},{"unstructured":"Giaro, K., Kubale, M., MaFlafiejski, M., Piwakowski, K.: Chromatic scheduling of dedicated 2-processor UET tasks to minimize mean flow time. Proc. ETFA\u201999, Barcelona (1999) 343\u2013347","key":"10_CR7"},{"key":"10_CR8","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1016\/S0020-0190(00)00072-7","volume":"75","author":"K. Giaro","year":"2000","unstructured":"Giaro, K., Kubale, M.: Edge-chromatic sum of trees and bounded cyclicity graphs. Inf. Process. Lett. 75 (2000) 65\u201369","journal-title":"Inf. Process. Lett."},{"unstructured":"Giaro, K., Kubale, M., Piwakowski, K.: Complexity results on open shop scheduling to minimize weighted mean flow time of operations. (in preparation)","key":"10_CR9"},{"key":"10_CR10","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1007\/3-540-48686-0_27","volume-title":"Computing and Combinatorics Conference","author":"M.M. Halld\u00f3rsson","year":"1999","unstructured":"Halld\u00f3rsson, M.M., Kortsarz, G., Proskurowski, A., Salman, R., Shachnai, H., Telle, J.A., Multicoloring trees. Computing and Combinatorics Conference, Tokyo (1999), Lecture Notes in Computer Science 1627 (1999) 271\u2013280"},{"key":"10_CR11","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1016\/0166-218X(94)90012-4","volume":"55","author":"J.A. Hoogeveen","year":"1994","unstructured":"Hoogeveen, J.A., van de Velde, S.L., Veltman, B.: Complexity of scheduling multiprocessor tasks with prespecified processor allocations. Disc. Appl. Math. 55 (1994) 259\u2013272","journal-title":"Disc. Appl. Math."},{"key":"10_CR12","doi-asserted-by":"publisher","first-page":"869","DOI":"10.1109\/TC.1985.1676647","volume":"34","author":"H. Krawczyk","year":"1985","unstructured":"Krawczyk, H., Kubale, M.: An approximation algorithm for diagnostic test scheduling in multicomputer systems. IEEE Trans. Comput. 34 (1985) 869\u2013872","journal-title":"IEEE Trans. Comput."},{"key":"10_CR13","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1016\/0020-0190(87)90176-1","volume":"24","author":"M. Kubale","year":"1987","unstructured":"Kubale, M.: The complexity of scheduling independent two-processor tasks on dedicated processors. Inf. Process. Lett. 24 (1987) 141\u2013147","journal-title":"Inf. Process. Lett."},{"key":"10_CR14","doi-asserted-by":"publisher","first-page":"242","DOI":"10.1016\/0377-2217(96)00131-2","volume":"94","author":"M. Kubale","year":"1996","unstructured":"Kubale, M.: Preemptive versus nonpreemptive scheduling of biprocessor tasks on dedicated processors. Euro. J. Oper. Res. 94 (1996) 242\u2013251","journal-title":"Euro. J. Oper. Res."},{"key":"10_CR15","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1016\/0012-365X(95)00191-X","volume":"150","author":"M. Kubale","year":"1996","unstructured":"Kubale, M., Piwakowski, K.: A linear algorithm for edge coloring of binomial trees. Disc. Math. 150 (1996) 247\u2013256","journal-title":"Disc. Math."},{"key":"10_CR16","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"288","DOI":"10.1007\/3-540-44679-6_32","volume-title":"Algorithms for the cost edge-coloring of tress","author":"X. Zhou","year":"2001","unstructured":"Zhou, X., Nishizeki, T.: Algorithms for the cost edge-coloring of tress. Lecture Notes in Computer Science 2108 (2001) 288\u2013297"}],"container-title":["Lecture Notes in Computer Science","Parallel Processing and Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-48086-2_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T09:20:31Z","timestamp":1558257631000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-48086-2_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540437925","9783540480860"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/3-540-48086-2_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2002]]},"assertion":[{"value":"6 June 2002","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}