{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,4]],"date-time":"2025-07-04T13:25:20Z","timestamp":1751635520771},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540662792"},{"type":"electronic","value":"9783540484479"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1999]]},"DOI":"10.1007\/3-540-48447-7_13","type":"book-chapter","created":{"date-parts":[[2007,11,13]],"date-time":"2007-11-13T21:42:14Z","timestamp":1194990134000},"page":"110-121","source":"Crossref","is-referenced-by-count":6,"title":["General Multiprocessor Task Scheduling: Approximate Solutions in Linear Time"],"prefix":"10.1007","author":[{"given":"Klaus","family":"Jansen","sequence":"first","affiliation":[]},{"given":"Lorant","family":"Porkolab","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2002,7,18]]},"reference":[{"key":"13_CR1","series-title":"Lect Notes Comput Sci","first-page":"1","volume-title":"Proceedings of the 5th Annual European Symposium on Algorithms","author":"A. K. Amoura","year":"1997","unstructured":"A. K. Amoura, E. Bampis, C. Kenyon and Y. Manoussakis, Scheduling independent multiprocessor tasks, Proceedings of the 5th Annual European Symposium on Algorithms (1997), LNCS 1284, 1\u201312."},{"key":"13_CR2","doi-asserted-by":"publisher","first-page":"493","DOI":"10.1007\/BF02057160","volume":"58","author":"L. Bianco","year":"1995","unstructured":"L. Bianco, J. Blazewicz, P. Dell Olmo and M. Drozdowski, Scheduling multiprocessor tasks on a dynamic configuration of dedicated processors, Annals of Operations Research 58 (1995), 493\u2013517.","journal-title":"Annals of Operations Research"},{"key":"13_CR3","doi-asserted-by":"publisher","first-page":"389","DOI":"10.1109\/TC.1986.1676781","volume":"C-35-5","author":"J. Blazewicz","year":"1986","unstructured":"J. Blazewicz, M. Drabowski and J. Weglarz, Scheduling multiprocessor tasks to minimize schedule length, IEEE Transactions on Computers, C-35-5 (1986), 389\u2013393.","journal-title":"IEEE Transactions on Computers"},{"key":"13_CR4","doi-asserted-by":"crossref","unstructured":"J. Chen and C.-Y. Lee, General multiprocessor tasks scheduling, Naval Research Logistics, in press.","DOI":"10.1002\/(SICI)1520-6750(199902)46:1<57::AID-NAV4>3.0.CO;2-H"},{"key":"13_CR5","doi-asserted-by":"crossref","unstructured":"J. Chen and A. Miranda, A polynomial time approximation scheme for general multiprocessor job scheduling, Proceedings of the 31st Annual ACM Symposium on the Theory of Computing (1999), 418\u2013427.","DOI":"10.1145\/301250.301363"},{"key":"13_CR6","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1016\/0377-2217(96)00123-3","volume":"94","author":"M. Drozdowski","year":"1996","unstructured":"M. Drozdowski, Scheduling multiprocessor tasks-an overview, European Journal on Operations Research, 94 (1996), 215\u2013230.","journal-title":"European Journal on Operations Research"},{"key":"13_CR7","doi-asserted-by":"publisher","first-page":"473","DOI":"10.1137\/0402042","volume":"2","author":"J. Du","year":"1989","unstructured":"J. Du and J. Leung, Complexity of scheduling parallel task systems, SIAM Journal on Discrete Mathematics, 2 (1989), 473\u2013487.","journal-title":"SIAM Journal on Discrete Mathematics"},{"key":"13_CR8","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1287\/moor.21.2.321","volume":"21","author":"M. D. Grigoriadis","year":"1996","unstructured":"M. D. Grigoriadis and L. G. Khachiyan, Coordination complexity of parallel price-directive decomposition, Mathematics of Operations Research 21 (1996), 321\u2013340.","journal-title":"Mathematics of Operations Research"},{"key":"13_CR9","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1016\/0166-218X(94)90012-4","volume":"55","author":"J. A. Hoogeveen","year":"1994","unstructured":"J. A. Hoogeveen, S. L. van de Velde and B. Veltman, Complexity of scheduling multiprocessor tasks with prespecified processor allocations, Discrete Applied Mathematics 55 (1994), 259\u2013272.","journal-title":"Discrete Applied Mathematics"},{"key":"13_CR10","doi-asserted-by":"crossref","unstructured":"K. Jansen and L. Porkolab, Linear-time approximation schemes for scheduling malleable parallel tasks, Proceedings of the 10th Annual ACM-SIAM Symposium on Discrete Algorithms (1999), 490\u2013498.","DOI":"10.1145\/301250.301361"},{"key":"13_CR11","doi-asserted-by":"crossref","unstructured":"K. Jansen and L. Porkolab, Improved approximation schemes for scheduling unrelated parallel machines, Proceedings of the 31st Annual ACM Symposium on the Theory of Computing (1999), 408\u2013417.","DOI":"10.1145\/301250.301361"},{"key":"13_CR12","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1287\/moor.20.2.257","volume":"20","author":"S. A. Plotkin","year":"1995","unstructured":"S. A. Plotkin, D. B. Shmoys and E. Tardos, Fast approximation algorithms for fractional packing and covering problems, Mathematics of Operations Research 20 (1995), 257\u2013301.","journal-title":"Mathematics of Operations Research"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Data Structures"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-48447-7_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,14]],"date-time":"2023-05-14T18:13:33Z","timestamp":1684088013000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-48447-7_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999]]},"ISBN":["9783540662792","9783540484479"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/3-540-48447-7_13","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[1999]]}}}