{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T18:27:23Z","timestamp":1725560843680},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540210795"},{"type":"electronic","value":"9783540245926"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-24592-6_2","type":"book-chapter","created":{"date-parts":[[2010,7,29]],"date-time":"2010-07-29T03:13:33Z","timestamp":1280373213000},"page":"13-26","source":"Crossref","is-referenced-by-count":2,"title":["Open Block Scheduling in Optical Communication Networks"],"prefix":"10.1007","author":[{"given":"Alexander A.","family":"Ageev","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Aleksei V.","family":"Fishkin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alexander V.","family":"Kononov","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sergey V.","family":"Sevastianov","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"2_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/3-540-63397-9_1","volume-title":"Algorithms - ESA \u201997","author":"A.K. Amoura","year":"1997","unstructured":"Amoura, A.K., Bampis, E., Kenyon, C., Manoussakis, Y.: Scheduling independent multiprocessor tasks. In: Burkard, R.E., Woeginger, G.J. (eds.) ESA 1997. LNCS, vol.\u00a01284, pp. 1\u201312. Springer, Heidelberg (1997)"},{"key":"2_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"391","DOI":"10.1007\/3-540-36136-7_35","volume-title":"Algorithms and Computation","author":"E. Bampis","year":"2002","unstructured":"Bampis, E., Caramia, M., Fiala, J., Fishkin, A.V., Iovanella, A.: On scheduling of independent dedicated multiprocessor tasks. In: Bose, P., Morin, P. (eds.) ISAAC 2002. LNCS, vol.\u00a02518, pp. 391\u2013402. Springer, Heidelberg (2002)"},{"key":"2_CR3","doi-asserted-by":"publisher","first-page":"100","DOI":"10.1287\/moor.8.1.100","volume":"8","author":"T. Fiala","year":"1983","unstructured":"Fiala, T.: An algorithm for the open-shop problem. Math. Oper. Res.\u00a08, 100\u2013109 (1983)","journal-title":"Math. Oper. Res."},{"key":"2_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"875","DOI":"10.1007\/3-540-48224-5_71","volume-title":"Automata, Languages and Programming","author":"A.V. Fishkin","year":"2001","unstructured":"Fishkin, A.V., Jansen, K., Porkolab, L.: On minimizing average weighted completion time of multiprocessor tasks with release dates. In: Orejas, F., Spirakis, P.G., van Leeuwen, J. (eds.) ICALP 2001. LNCS, vol.\u00a02076, pp. 875\u2013886. Springer, Heidelberg (2001)"},{"key":"2_CR5","volume-title":"Computers and intractability: A guide to the theory of NP-completeness","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and intractability: A guide to the theory of NP-completeness. Freeman, San Francisco (1979)"},{"key":"2_CR6","doi-asserted-by":"publisher","first-page":"665","DOI":"10.1145\/321978.321985","volume":"23","author":"T. Gonzalez","year":"1976","unstructured":"Gonzalez, T., Sahni, S.: Open shop scheduling to minimize finish time. Journal of the ACM\u00a023, 665\u2013679 (1976)","journal-title":"Journal of the ACM"},{"key":"2_CR7","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., de Velde, S.L.V., Veltman, B.: Complexity of scheduling multiprocessor tasks with prespecified processor allocations. Discrete Appl. Math.\u00a055, 259\u2013272 (1994)","journal-title":"Discrete Appl. Math."},{"key":"2_CR8","series-title":"ch. Scheduling algorithms for unicast, multicast, and broadcast","volume-title":"Optical WDM networks: Principles and practice","author":"G.N. Rouskas","year":"2000","unstructured":"Rouskas, G.N.: Optical WDM networks: Principles and practice. ch. Scheduling algorithms for unicast, multicast, and broadcast. Kluwer Academic Publishers, Dordrecht (2000)"},{"key":"2_CR9","doi-asserted-by":"publisher","first-page":"918","DOI":"10.1007\/BF01291296","volume":"28","author":"S.V. Sevast\u2019janov","year":"1992","unstructured":"Sevast\u2019janov, S.V.: Polynomially solvable case of the open-shop problem with arbitrary number of machines. Cybernet. Systems Anal.\u00a028, 918\u2013933 (1992) (Translated from Russian)","journal-title":"Cybernet. Systems Anal."},{"key":"2_CR10","doi-asserted-by":"publisher","first-page":"90","DOI":"10.1287\/moor.20.1.90","volume":"20","author":"S.V. Sevast\u2019janov","year":"1995","unstructured":"Sevast\u2019janov, S.V.: Vector summation in Banach space and polynomial algorithms for flow shops and open shops. Math. Oper. Res.\u00a020, 90\u2013103 (1995)","journal-title":"Math. Oper. Res."},{"key":"2_CR11","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1023\/A:1018908013582","volume":"83","author":"S. Sevastianov","year":"1998","unstructured":"Sevastianov, S.: Nonstrict vector summation in multi-operation scheduling. Annals of Oper. Res.\u00a083, 179\u2013211 (1998)","journal-title":"Annals of Oper. Res."},{"key":"2_CR12","first-page":"191","volume":"82","author":"S.V. Sevastianov","year":"1998","unstructured":"Sevastianov, S.V., Woeginger, G.J.: Makespan minimization in open shops: A polynomial time approximation scheme. Mathematical Programming\u00a082, 191\u2013198 (1998)","journal-title":"Mathematical Programming"},{"key":"2_CR13","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1016\/S0166-218X(00)00375-9","volume":"114","author":"S.V. Sevastianov","year":"2001","unstructured":"Sevastianov, S.V., Woeginger, G.J.: Linear time approximation scheme for the multiprocessor open shop problem. Discrete Appl. Math.\u00a0114, 273\u2013288 (2001)","journal-title":"Discrete Appl. Math."},{"key":"2_CR14","unstructured":"Thaker, D., Rouskas, G.N.: Multi-destination communication in broadcast WDM networks: A survey. Tech. Rep. 2000-08, North Caroline State University (2000)"},{"key":"2_CR15","doi-asserted-by":"publisher","first-page":"288","DOI":"10.1287\/opre.45.2.288","volume":"45","author":"D.P. Williamson","year":"1997","unstructured":"Williamson, D.P., Hall, L.A., Hoogeveen, J.A., Hurkens, C.A.J., Lenstra, J.K., Sevastianov, S.V., Shmoys, D.B.: Short shop schedules. Oper. Res.\u00a045, 288\u2013294 (1997)","journal-title":"Oper. Res."}],"container-title":["Lecture Notes in Computer Science","Approximation and Online Algorithms"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-24592-6_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,17]],"date-time":"2019-03-17T09:50:31Z","timestamp":1552816231000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-24592-6_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540210795","9783540245926"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-24592-6_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}