{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,6]],"date-time":"2026-05-06T03:36:53Z","timestamp":1778038613025,"version":"3.51.4"},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540001423","type":"print"},{"value":"9783540361367","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-36136-7_35","type":"book-chapter","created":{"date-parts":[[2008,11,25]],"date-time":"2008-11-25T19:07:11Z","timestamp":1227640031000},"page":"391-402","source":"Crossref","is-referenced-by-count":13,"title":["Scheduling of Independent Dedicated Multiprocessor Tasks"],"prefix":"10.1007","author":[{"given":"Evripidis","family":"Bampis","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Massimiliano","family":"Caramia","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ji\u0159\u00ed","family":"Fiala","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Aleksei V.","family":"Fishkin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Antonio","family":"Iovanella","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2002,11,8]]},"reference":[{"key":"35_CR1","doi-asserted-by":"crossref","unstructured":"M. Ammar, G. Polyzos, and S. Tripathi (Eds.). Special issue on network support for multipoint communication. IEEE Journal Selected Areas in Communications, 15, 1997.","DOI":"10.1109\/JSAC.1997.564127"},{"key":"35_CR2","series-title":"Lect Notes Comput Sci","first-page":"1","volume-title":"Proceedings 5th 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. In Proceedings 5th European Symposium on Algorithms, LNCS 1284, pages 1\u201312. Springer Verlag, 1997."},{"key":"35_CR3","unstructured":"E. Bampis and A. Kononov. On the approximability of scheduling multiprocessor tasks with time dependent processing and processor requirements. In Proceedings 15th International Parallel and Distributed Processing Symposium, San Francisco, 2001."},{"key":"35_CR4","doi-asserted-by":"publisher","first-page":"804","DOI":"10.1137\/S0097539796302531","volume":"27","author":"M. Bellare","year":"1998","unstructured":"M. Bellare, O. Goldreich, and M. Sudan. Free bits, PCPs, and non-approximability \u2014 towards tight results. SIAM Journal on Computing, 27:804\u2013915, 1998.","journal-title":"SIAM Journal on Computing"},{"key":"35_CR5","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1007\/3-540-49381-6_14","volume-title":"Proceedings 9th Annual International Symposium on Algorithms and Computation","author":"S. Bischof","year":"1998","unstructured":"S. Bischof and E.W. Mayr. On-line scheduling of parallel jobs with runtime restrictions. In Proceedings 9th Annual International Symposium on Algorithms and Computation, LNCS 1533, pages 119\u2013129. Springer Verlag, 1998."},{"key":"35_CR6","unstructured":"M. Caramia, P. Dell\u2019Olmo, and A. Iovanella. Lower bound algorithms for multiprocessor task scheduling with ready times, 2001. Personal communications."},{"key":"35_CR7","unstructured":"M. Caramia, P. Dell\u2019Olmo, and A. Iovanella. On-line algorithms for multiprocessor task scheduling with ready times, 2001. Personal communications."},{"key":"35_CR8","doi-asserted-by":"crossref","unstructured":"M. Drozdowski. Scheduling multiprocessor tasks \u2014 an overview. European Journal on Operations Research, pages 215\u2013230, 1996.","DOI":"10.1016\/0377-2217(96)00123-3"},{"key":"35_CR9","doi-asserted-by":"crossref","unstructured":"A. Feldmann, M.-Y. Kao, J. Sgall, and S.H. Teng. Optimal online scheduling of parallel tasks with dependencies. In Proceedings 25th ACM Symposium on the Theory of Computing, pages 642\u2013651, 1993.","DOI":"10.1145\/167088.167254"},{"key":"35_CR10","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1016\/0304-3975(94)90152-X","volume":"130","author":"A. Feldmann","year":"1994","unstructured":"A. Feldmann, J. Sgall, and S-H. Teng. Dynamic scheduling on parallel machines. Theoretical Computer Science, 130:49\u201372, 1994.","journal-title":"Theoretical Computer Science"},{"key":"35_CR11","series-title":"Lect Notes Comput Sci","volume-title":"Online algorithms. The state of the art","year":"1998","unstructured":"A. Fiat and G. J. Woeginger, editors. Online algorithms. The state of the art. LNCS 1442. Springer Verlag, 1998."},{"key":"35_CR12","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"875","DOI":"10.1007\/3-540-48224-5_71","volume-title":"Proceedings 28th International Colloquium on Automata, Languages and Programming","author":"A. V. Fishkin","year":"2001","unstructured":"A. V. Fishkin, K. Jansen, and L. Porkolab. On minimizing average weighted completion time of multiprocessor tasks with release dates. In Proceedings 28th International Colloquium on Automata, Languages and Programming, LNCS 2076, pages 875\u2013886, Crete, 2001. Springer Verlag."},{"key":"35_CR13","doi-asserted-by":"crossref","unstructured":"O. Gerstel, B. Li, A. McGuire, G. N. Rouskas, K. Sivalingam, and Z. Zhang (Eds.). Special issue on protocols and architectures for next generations optical wdm networks. IEEE Journal Selected Areas in Communications, 18, October 2000.","DOI":"10.1109\/JSAC.2000.887903"},{"key":"35_CR14","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1016\/0166-218X(94)00160-F","volume":"61","author":"M. X. Goemans","year":"1995","unstructured":"M. X. Goemans. An approximation algorithm for scheduling on three dedicated processors. Discrete Applied Mathematics, 61:49\u201359, 1995.","journal-title":"Discrete Applied Mathematics"},{"key":"35_CR15","doi-asserted-by":"crossref","unstructured":"R. L. Graham, E. L. Lawler, J. K. Lenstra, and A. H. G. Rinnooy Kan. Optimization and approximation in deterministic scheduling: A survey. Annals of Discrete Mathematics, pages 287\u2013326, 1979.","DOI":"10.1016\/S0167-5060(08)70356-X"},{"key":"35_CR16","unstructured":"The NGI Helious project: Regional Testbed Optical Access Network For IP Multicast and Differentiated Services. http:\/\/projects.anr.mcnc.org\/Helios\/ , 2000."},{"key":"35_CR17","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:259\u2013272, 1994.","journal-title":"Discrete Applied Mathematics"},{"key":"35_CR18","doi-asserted-by":"crossref","first-page":"66","DOI":"10.1109\/35.815454","volume":"38","author":"M. Kuznetsov","year":"2000","unstructured":"M. Kuznetsov, N. Froberg, S. Henion, H. Rao, J. Korn, K. Rauschenbach, E. Modiano, and V. Chan. A next-generation optical regional access networks. IEEE Communications Magazine, 38:66\u201372, January 2000.","journal-title":"IEEE Communications Magazine"},{"key":"35_CR19","doi-asserted-by":"crossref","unstructured":"B. Mukherjee. Wdm-based local lightwave networks Part I: Single-hop systems. IEEE Network Magazine, pages 12\u201327, 1992.","DOI":"10.1109\/65.139139"},{"key":"35_CR20","doi-asserted-by":"publisher","first-page":"1313","DOI":"10.1137\/S0097539793248317","volume":"24","author":"D.B. Shmoys","year":"1995","unstructured":"D.B. Shmoys, J. Wein, and D.P. Williamson. Scheduling parallel machines on-line. SIAM Journal on Computing, 24:1313\u20131331, 1995.","journal-title":"SIAM Journal on Computing"},{"key":"35_CR21","unstructured":"K. M. Sivalingam and S. Subramaniam, editors. Optical WDM networks: Principles and practice. Kluwer Academic Publishers, 2000."},{"key":"35_CR22","unstructured":"D. Thaker and G. N. Rouskas. Multi-destination communication in broadcast WDM networks: A survey. Technical Report 2000-08, North Caroline State University, 2000."},{"key":"35_CR23","doi-asserted-by":"crossref","first-page":"1349","DOI":"10.1109\/50.511666","volume":"14","author":"R. E. Wagner","year":"1996","unstructured":"R. E. Wagner, R. C. Alferness, A. A. M. Saleh, and M. S. Goodman. MONET: Multiwavelength Optical Networking. Journal of Lightwave Technology, 14:1349, June 1996.","journal-title":"Journal of Lightwave Technology"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-36136-7_35","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,15]],"date-time":"2019-05-15T18:29:01Z","timestamp":1557944941000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-36136-7_35"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540001423","9783540361367"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/3-540-36136-7_35","relation":{},"ISSN":["0302-9743"],"issn-type":[{"value":"0302-9743","type":"print"}],"subject":[],"published":{"date-parts":[[2002]]}}}