{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T20:08:02Z","timestamp":1725566882083},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540282396"},{"type":"electronic","value":"9783540318743"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11538462_13","type":"book-chapter","created":{"date-parts":[[2010,9,28]],"date-time":"2010-09-28T04:13:22Z","timestamp":1285647202000},"page":"146-157","source":"Crossref","is-referenced-by-count":9,"title":["Scheduling on Unrelated Machines Under Tree-Like Precedence Constraints"],"prefix":"10.1007","author":[{"given":"V. S. Anil","family":"Kumar","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Madhav V.","family":"Marathe","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Srinivasan","family":"Parthasarathy","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Aravind","family":"Srinivasan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"3","key":"13_CR1","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1016\/S0167-6377(99)00010-3","volume":"24","author":"D. Bertsimas","year":"1999","unstructured":"Bertsimas, D., Teo, C.-P., Vohra, R.: On Dependent Randomized Rounding Algorithms. Operations Research Letters\u00a024(3), 105\u2013114 (1999)","journal-title":"Operations Research Letters"},{"key":"13_CR2","doi-asserted-by":"publisher","first-page":"212","DOI":"10.1006\/jagm.2001.1184","volume":"41","author":"C. Chekuri","year":"2001","unstructured":"Chekuri, C., Bender, M.: An Efficient Approximation Algorithm for Minimizing Makespan on Uniformly Related Machines. Journal of Algorithms\u00a041, 212\u2013224 (2001)","journal-title":"Journal of Algorithms"},{"key":"13_CR3","unstructured":"Chekuri, C., Khanna, S.: Approximation algorithms for minimizing weighted completion time. Handbook of Scheduling (2004)"},{"issue":"2","key":"13_CR4","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1006\/jagm.1998.0987","volume":"30","author":"F.A. Chudak","year":"1999","unstructured":"Chudak, F.A., Shmoys, D.B.: Approximation algorithms for precedence-constrained scheduling problems on parallel machines that run at different speeds. Journal of Algorithms\u00a030(2), 323\u2013343 (1999)","journal-title":"Journal of Algorithms"},{"key":"13_CR5","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1007\/s004930200018","volume":"22","author":"U. Feige","year":"2002","unstructured":"Feige, U., Scheideler, C.: Improved bounds for acyclic job shop scheduling. Combinatorica\u00a022, 361\u2013399 (2002)","journal-title":"Combinatorica"},{"key":"13_CR6","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1137\/S0895480199326104","volume":"14","author":"L.A. Goldberg","year":"2001","unstructured":"Goldberg, L.A., Paterson, M., Srinivasan, A., Sweedyk, E.: Better approximation guarantees for job-shop scheduling. SIAM Journal on Discrete Mathematics\u00a014, 67\u201392 (2001)","journal-title":"SIAM Journal on Discrete Mathematics"},{"key":"13_CR7","unstructured":"Hall, L.: Approximation Algorithms for Scheduling. In: Hochbaum, D.S. (ed.) Approximation Algorithms for NP-Hard Problems, PWS Press (1997)"},{"key":"13_CR8","doi-asserted-by":"publisher","first-page":"513","DOI":"10.1287\/moor.22.3.513","volume":"22","author":"L. Hall","year":"1997","unstructured":"Hall, L., Schulz, A., Shmoys, D.B., Wein, J.: Scheduling to minimize average completion time: Offline and online algorithms. Mathematics of Operations Research\u00a022, 513\u2013544 (1997)","journal-title":"Mathematics of Operations Research"},{"key":"13_CR9","doi-asserted-by":"crossref","unstructured":"Jansen, K., Porkolab, L.: Improved Approximation Schemes for Scheduling Unrelated Parallel Machines. Proc. ACM Symposium on Theory of Computing (STOC), pp. 408\u2013417 (1999)","DOI":"10.1145\/301250.301361"},{"key":"13_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1007\/978-3-540-24669-5_14","volume-title":"Parallel Processing and Applied Mathematics","author":"K. Jansen","year":"2003","unstructured":"Jansen, K., Solis-oba, R.: Scheduling jobs with chain precedence constraints. In: Wyrzykowski, R., Dongarra, J., Paprzycki, M., Wa\u015bniewski, J. (eds.) PPAM 2004. LNCS, vol.\u00a03019, pp. 105\u2013112. Springer, Heidelberg (2003)"},{"key":"13_CR11","doi-asserted-by":"crossref","unstructured":"Jansen, K., Solis-Oba, R., Sviridenko, M.: Makespan Minimization in Job Shops: A Polynomial Time Approximation Scheme. In: Proc. ACM Symposium on Theory of Computing (STOC), pp. 394\u2013399 (1999)","DOI":"10.1145\/301250.301351"},{"key":"13_CR12","doi-asserted-by":"crossref","unstructured":"Leonardi, S., Raz, D. In: Approximating total flow time on parallel machines. In: Proc. ACM Symposium on Theory of Computing, pp. 110\u2013119 (1997)","DOI":"10.1145\/258533.258562"},{"key":"13_CR13","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1007\/BF01585745","volume":"46","author":"J.K. Lenstra","year":"1990","unstructured":"Lenstra, J.K., Shmoys, D.B., Tardos, \u00c9.: Approximation algorithms for scheduling unrelated parallel machines. Mathematical Programming\u00a046, 259\u2013271 (1990)","journal-title":"Mathematical Programming"},{"key":"13_CR14","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1007\/BF01215349","volume":"14","author":"F.T. Leighton","year":"1994","unstructured":"Leighton, F.T., Maggs, B., Rao, S.: Packet routing and jobshop scheduling in O(congestion + dilation) Steps. Combinatorica\u00a014, 167\u2013186 (1994)","journal-title":"Combinatorica"},{"key":"13_CR15","doi-asserted-by":"publisher","first-page":"375","DOI":"10.1007\/s004930050061","volume":"19","author":"F.T. Leighton","year":"1999","unstructured":"Leighton, F.T., Maggs, B., Richa, A.: Fast algorithms for finding O(congestion + dilation) packet routing schedules. Combinatorica\u00a019, 375\u2013401 (1999)","journal-title":"Combinatorica"},{"key":"13_CR16","doi-asserted-by":"crossref","unstructured":"Lin, J.H., Vitter, J.S.: \u03b5-approximations with minimum packing constraint violation. In: Proceedings of the ACM Symposium on Theory of Computing, pp. 771\u2013782 (1992)","DOI":"10.1145\/129712.129787"},{"key":"13_CR17","doi-asserted-by":"crossref","unstructured":"Linial, N., Magen, A., Saks, M.E.: Trees and Euclidean Metrics. In: Proceedings of the ACM Symposium on Theory of Computing, pp. 169\u2013175 (1998)","DOI":"10.1145\/276698.276726"},{"key":"13_CR18","doi-asserted-by":"publisher","first-page":"350","DOI":"10.1137\/S0097539793250767","volume":"26","author":"A. Panconesi","year":"1997","unstructured":"Panconesi, A., Srinivasan, A.: Randomized distributed edge coloring via an extension of the Chernoff-Hoeffding bounds. SIAM Journal on Computing\u00a026, 350\u2013368 (1997)","journal-title":"SIAM Journal on Computing"},{"key":"13_CR19","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1002\/jos.96","volume":"5","author":"M. Queyranne","year":"2002","unstructured":"Queyranne, M., Sviridenko, M.: Approximation algorithms for shop scheduling problems with minsum objective. Journal of Scheduling\u00a05, 287\u2013305 (2002)","journal-title":"Journal of Scheduling"},{"issue":"2","key":"13_CR20","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1002\/jos.93","volume":"5","author":"A. Schulz","year":"2002","unstructured":"Schulz, A., Skutella, M.: The power of \u03b1-points in preemptive single machine scheduling. Journal of Scheduling\u00a05(2), 121\u2013133 (2002)","journal-title":"Journal of Scheduling"},{"key":"13_CR21","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1002\/(SICI)1099-1425(199909\/10)2:5<203::AID-JOS26>3.0.CO;2-5","volume":"2","author":"P. Schuurman","year":"1999","unstructured":"Schuurman, P., Woeginger, G.J.: Polynomial time approximation algorithms for machine scheduling: Ten open problems. Journal of Scheduling\u00a02, 203\u2013213 (1999)","journal-title":"Journal of Scheduling"},{"key":"13_CR22","doi-asserted-by":"publisher","first-page":"617","DOI":"10.1137\/S009753979222676X","volume":"23","author":"D.B. Shmoys","year":"1994","unstructured":"Shmoys, D.B., Stein, C., Wein, J.: Improved approximation algorithms for shop scheduling problems. SIAM Journal on Computing\u00a023, 617\u2013632 (1994)","journal-title":"SIAM Journal on Computing"},{"issue":"2","key":"13_CR23","doi-asserted-by":"publisher","first-page":"206","DOI":"10.1145\/375827.375840","volume":"46","author":"M. Skutella","year":"2001","unstructured":"Skutella, M.: Convex quadratic and semidefinite relaxations in scheduling. Journal of the ACM\u00a046(2), 206\u2013242 (2001)","journal-title":"Journal of the ACM"}],"container-title":["Lecture Notes in Computer Science","Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11538462_13.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T20:13:44Z","timestamp":1605644024000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11538462_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540282396","9783540318743"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/11538462_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}