{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,15]],"date-time":"2026-02-15T08:46:45Z","timestamp":1771145205856,"version":"3.50.1"},"reference-count":15,"publisher":"Springer Science and Business Media LLC","issue":"3","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Sched"],"published-print":{"date-parts":[[2012,6]]},"DOI":"10.1007\/s10951-011-0225-1","type":"journal-article","created":{"date-parts":[[2011,2,17]],"date-time":"2011-02-17T01:47:00Z","timestamp":1297907220000},"page":"323-332","source":"Crossref","is-referenced-by-count":6,"title":["Scheduling of pipelined operator graphs"],"prefix":"10.1007","volume":"15","author":[{"given":"Hans L.","family":"Bodlaender","sequence":"first","affiliation":[]},{"given":"Petra","family":"Schuurman","sequence":"additional","affiliation":[]},{"given":"Gerhard J.","family":"Woeginger","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2011,2,18]]},"reference":[{"key":"225_CR1","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1002\/(SICI)1099-1425(199806)1:1<55::AID-JOS2>3.0.CO;2-J","volume":"1","author":"N. Alon","year":"1998","unstructured":"Alon, N., Azar, Y., Woeginger, G. J., & Yadid, T. (1998). Approximation schemes for scheduling on parallel machines. Journal of Scheduling, 1, 55\u201366.","journal-title":"Journal of Scheduling"},{"key":"225_CR2","doi-asserted-by":"crossref","first-page":"1305","DOI":"10.1137\/S0097539793251219","volume":"25","author":"H. L. Bodlaender","year":"1996","unstructured":"Bodlaender, H. L. (1996). A linear time algorithm for finding tree-decompositions of small treewidth. SIAM Journal on Computing, 25, 1305\u20131317.","journal-title":"SIAM Journal on Computing"},{"key":"225_CR3","series-title":"LNCS","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1007\/BFb0029946","volume-title":"Proceedings of the 22nd international symposium on mathematical foundations of computer science (MFCS\u20191997)","author":"H. L. Bodlaender","year":"1997","unstructured":"Bodlaender, H. L. (1997). Treewidth: Algorithmic techniques and results. In I. Privara & P. Ruzicka (Eds.), LNCS: Vol. 1295. Proceedings of the 22nd international symposium on mathematical foundations of computer science (MFCS\u20191997) (pp. 19\u201336). Berlin: Springer."},{"key":"225_CR4","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0304-3975(97)00228-4","volume":"209","author":"H. L. Bodlaender","year":"1998","unstructured":"Bodlaender, H. L. (1998). A partial\u00a0k-arboretum of graphs with bounded treewidth. Theoretical Computer Science, 209, 1\u201345.","journal-title":"Theoretical Computer Science"},{"key":"225_CR5","doi-asserted-by":"crossref","first-page":"481","DOI":"10.1137\/0404043","volume":"4","author":"R. B. Borie","year":"1991","unstructured":"Borie, R. B., Parker, R. G., & Tovey, C. A. (1991). Deterministic decomposition of recursive graph classes. SIAM Journal on Discrete Mathematics, 4, 481\u2013501.","journal-title":"SIAM Journal on Discrete Mathematics"},{"key":"225_CR6","first-page":"255","volume-title":"Proceedings of the 14th ACM symposium on principles of database systems (PODS\u201995)","author":"C. Chekuri","year":"1995","unstructured":"Chekuri, C., Hasan, W., & Motwani, R. (1995). Scheduling problems in parallel query optimization. In Proceedings of the 14th ACM symposium on principles of database systems (PODS\u201995) (pp.\u00a0255\u2013265)."},{"key":"225_CR7","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. (1979). Computers and intractability: a guide to the theory of NP -completeness. San Francisco: Freeman."},{"key":"225_CR8","first-page":"1","volume-title":"Proceedings of the 7th ACM symposium on principles of distributed computing (PODC\u201988)","author":"J. Gray","year":"1988","unstructured":"Gray, J. (1988). The cost of messages. In Proceedings of the 7th ACM symposium on principles of distributed computing (PODC\u201988) (pp. 1\u20137)."},{"key":"225_CR9","first-page":"36","volume-title":"Proceedings of the 20th international conference on very large databases","author":"W. Hasan","year":"1994","unstructured":"Hasan, W., & Motwani, R. (1994). Optimization algorithms for exploiting the parallelism-communication tradeoff in pipelined parallelism. In Proceedings of the 20th international conference on very large databases (pp. 36\u201347)."},{"key":"225_CR10","doi-asserted-by":"crossref","first-page":"144","DOI":"10.1145\/7531.7535","volume":"34","author":"D. S. Hochbaum","year":"1987","unstructured":"Hochbaum, D. S., & Shmoys, D. B. (1987). Using dual approximation algorithms for scheduling problems: theoretical and practical results. Journal of the Association of Computing Machinery, 34, 144\u2013162.","journal-title":"Journal of the Association of Computing Machinery"},{"key":"225_CR11","doi-asserted-by":"crossref","first-page":"463","DOI":"10.1145\/321906.321909","volume":"22","author":"O. Ibarra","year":"1975","unstructured":"Ibarra, O., & Kim, C. E. (1975). Fast approximation algorithms for the knapsack and sum of subset problems. Journal of the Association of Computing Machinery, 22, 463\u2013468.","journal-title":"Journal of the Association of Computing Machinery"},{"key":"225_CR12","doi-asserted-by":"crossref","first-page":"538","DOI":"10.1287\/moor.8.4.538","volume":"8","author":"H. W. Lenstra","year":"1983","unstructured":"Lenstra, H. W. (1983). Integer programming with a fixed number of variables. Mathematics of Operations Research, 8, 538\u2013548.","journal-title":"Mathematics of Operations Research"},{"key":"225_CR13","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1016\/0167-8191(90)90056-F","volume":"16","author":"B. Veltman","year":"1990","unstructured":"Veltman, B., Lageweg, B. J., & Lenstra, J. K. (1990). Multiprocessor scheduling with communication delays. Parallel Computing, 16, 173\u2013182.","journal-title":"Parallel Computing"},{"key":"225_CR14","unstructured":"Wimer, T. V. (1987). Linear algorithms on\u00a0k-terminal graphs. PhD thesis, Dept. of Computer Science, Clemson University."},{"key":"225_CR15","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1287\/ijoc.12.1.57.11901","volume":"12","author":"G. J. Woeginger","year":"2000","unstructured":"Woeginger, G. J. (2000). When does a dynamic programming formulation guarantee the existence of an FPTAS? INFORMS Journal on Computing, 12, 57\u201375.","journal-title":"INFORMS Journal on Computing"}],"container-title":["Journal of Scheduling"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/www.springerlink.com\/index\/pdf\/10.1007\/s10951-011-0225-1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,19]],"date-time":"2017-06-19T19:51:28Z","timestamp":1497901888000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10951-011-0225-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,2,18]]},"references-count":15,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2012,6]]}},"alternative-id":["225"],"URL":"https:\/\/doi.org\/10.1007\/s10951-011-0225-1","relation":{},"ISSN":["1094-6136","1099-1425"],"issn-type":[{"value":"1094-6136","type":"print"},{"value":"1099-1425","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,2,18]]}}}