{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,20]],"date-time":"2025-11-20T06:20:40Z","timestamp":1763619640584},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540380443"},{"type":"electronic","value":"9783540380450"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11830924_4","type":"book-chapter","created":{"date-parts":[[2006,8,25]],"date-time":"2006-08-25T12:33:54Z","timestamp":1156509234000},"page":"15-26","source":"Crossref","is-referenced-by-count":8,"title":["Approximating Precedence-Constrained Single Machine Scheduling by Coloring"],"prefix":"10.1007","author":[{"given":"Christoph","family":"Amb\u00fchl","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Monaldo","family":"Mastrolilli","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ola","family":"Svensson","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"4_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1007\/11841036_6","volume-title":"Algorithms \u2013 ESA 2006","author":"C. Amb\u00fchl","year":"2006","unstructured":"Amb\u00fchl, C., Mastrolilli, M.: Single machine precedence constrained scheduling is a vertex cover problem. In: Azar, Y., Erlebach, T. (eds.) ESA 2006. LNCS, vol.\u00a04168, pp. 28\u201339. Springer, Heidelberg (2006)"},{"issue":"1-2","key":"4_CR2","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1016\/S0166-218X(98)00143-7","volume":"98","author":"C. Chekuri","year":"1999","unstructured":"Chekuri, C., Motwani, R.: Precedence constrained scheduling to minimize sum of weighted completion times on a single machine. Discrete Applied Mathematics\u00a098(1-2), 29\u201338 (1999)","journal-title":"Discrete Applied Mathematics"},{"key":"4_CR3","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1016\/S0167-6377(99)00056-5","volume":"25","author":"F.A. Chudak","year":"1999","unstructured":"Chudak, F.A., Hochbaum, D.S.: A half-integral linear programming relaxation for scheduling precedence-constrained jobs on a single machine. Operations Research Letters\u00a025, 199\u2013204 (1999)","journal-title":"Operations Research Letters"},{"issue":"4","key":"4_CR4","doi-asserted-by":"publisher","first-page":"1005","DOI":"10.1287\/moor.1050.0158","volume":"30","author":"J.R. Correa","year":"2005","unstructured":"Correa, J.R., Schulz, A.S.: Single machine scheduling with precedence constraints. IPCO 2004\u00a030(4), 1005\u20131021 (2005); Extended abstract in Proceedings of the 10th Conference on Integer Programming and Combinatorial Optimization (IPCO 2004), pp. 283\u2013297 (2004)","journal-title":"Mathematics of Operations Research"},{"key":"4_CR5","doi-asserted-by":"publisher","first-page":"600","DOI":"10.2307\/2371374","volume":"63","author":"B. Dushnik","year":"1941","unstructured":"Dushnik, B., Miller, E.: Partially ordered sets. American Journal of Mathematics\u00a063, 600\u2013610 (1941)","journal-title":"American Journal of Mathematics"},{"key":"4_CR6","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1023\/A:1006223715426","volume":"15","author":"S. Felsner","year":"1998","unstructured":"Felsner, S., M\u00f6hring, R.: Semi order dimension two is a comparability invariant. Order\u00a0(15), 385\u2013390 (1998)","journal-title":"Order"},{"issue":"2","key":"4_CR7","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1023\/A:1006429830221","volume":"17","author":"S. Felsner","year":"2000","unstructured":"Felsner, S., Trotter, W.T.: Dimension, graph and hypergraph coloring. Order\u00a017(2), 167\u2013177 (2000)","journal-title":"Order"},{"issue":"2","key":"4_CR8","doi-asserted-by":"publisher","first-page":"601","DOI":"10.1137\/S0097539794277123","volume":"31","author":"A. Garg","year":"2002","unstructured":"Garg, A., Tamassia, R.: On the computational complexity of upward and rectilinear planarity testing. SIAM Journal on Computing\u00a031(2), 601\u2013625 (2002)","journal-title":"SIAM Journal on Computing"},{"key":"4_CR9","first-page":"287","volume-title":"Annals of Discrete Mathematics","author":"R. Graham","year":"1979","unstructured":"Graham, R., Lawler, E., Lenstra, J.K., Rinnooy Kan, A.H.G.: Optimization and approximation in deterministic sequencing and scheduling: A survey. In: Annals of Discrete Mathematics, vol.\u00a05, pp. 287\u2013326. North\u2013Holland, Amsterdam (1979)"},{"key":"4_CR10","doi-asserted-by":"publisher","first-page":"513","DOI":"10.1287\/moor.22.3.513","volume":"22","author":"L.A. Hall","year":"1997","unstructured":"Hall, L.A., Schulz, A.S., Shmoys, D.B., Wein, J.: Scheduling to minimize average completion time: off-line and on-line algorithms. Mathematics of Operations Research\u00a022, 513\u2013544 (1997)","journal-title":"Mathematics of Operations Research"},{"key":"4_CR11","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1016\/0166-218X(83)90080-X","volume":"6","author":"D.S. Hochbaum","year":"1983","unstructured":"Hochbaum, D.S.: Efficient bounds for the stable set, vertex cover and set packing problems. Discrete Applied Mathematics\u00a06, 243\u2013254 (1983)","journal-title":"Discrete Applied Mathematics"},{"key":"4_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"612","DOI":"10.1007\/3-540-45749-6_54","volume-title":"Algorithms - ESA 2002","author":"S.G. Kolliopoulos","year":"2002","unstructured":"Kolliopoulos, S.G., Steiner, G.: Partially-ordered knapsack and applications to scheduling. In: M\u00f6hring, R.H., Raman, R. (eds.) ESA 2002. LNCS, vol.\u00a02461, pp. 612\u2013624. Springer, Heidelberg (2002)"},{"key":"4_CR13","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1016\/S0167-5060(08)70323-6","volume":"2","author":"E.L. Lawler","year":"1978","unstructured":"Lawler, E.L.: Sequencing jobs to minimize total weighted completion time subject to precedence constraints. Annals of Discrete Mathematics\u00a02, 75\u201390 (1978)","journal-title":"Annals of Discrete Mathematics"},{"key":"4_CR14","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1287\/opre.26.1.22","volume":"26","author":"J.K. Lenstra","year":"1978","unstructured":"Lenstra, J.K., Rinnooy Kan, A.H.G.: The complexity of scheduling under precedence constraints. Operations Research\u00a026, 22\u201335 (1978)","journal-title":"Operations Research"},{"issue":"6","key":"4_CR15","doi-asserted-by":"publisher","first-page":"981","DOI":"10.1287\/opre.51.6.981.24912","volume":"51","author":"F. Margot","year":"2003","unstructured":"Margot, F., Queyranne, M., Wang, Y.: Decompositions, network flows and a precedence constrained single machine scheduling problem. Operations Research\u00a051(6), 981\u2013992 (2003)","journal-title":"Operations Research"},{"key":"4_CR16","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1007\/978-94-009-2639-4_4","volume-title":"Algorithms and Order","author":"R.H. M\u00f6hring","year":"1989","unstructured":"M\u00f6hring, R.H.: Computationally tractable classes of ordered sets. In: Rival, I. (ed.) Algorithms and Order, pp. 105\u2013193. Kluwer Academic, Dordrecht (1989)"},{"issue":"3","key":"4_CR17","doi-asserted-by":"publisher","first-page":"655","DOI":"10.1016\/S0166-218X(03)00334-2","volume":"131","author":"N.N. Pisaruk","year":"2003","unstructured":"Pisaruk, N.N.: A fully combinatorial 2-approximation algorithm for precedence-constrained scheduling a single machine to minimize average weighted completion time. Discrete Applied Mathematics\u00a0131(3), 655\u2013663 (2003)","journal-title":"Discrete Applied Mathematics"},{"key":"4_CR18","doi-asserted-by":"crossref","first-page":"78","DOI":"10.1007\/BFb0120909","volume":"13","author":"C.N. Potts","year":"1980","unstructured":"Potts, C.N.: An algorithm for the single machine sequencing problem with precedence constraints. Mathematical Programming Study\u00a013, 78\u201387 (1980)","journal-title":"Mathematical Programming Study"},{"issue":"25","key":"4_CR19","doi-asserted-by":"crossref","first-page":"50","DOI":"10.1016\/0097-3165(78)90030-4","volume":"Series A","author":"I. Rabinovitch","year":"1978","unstructured":"Rabinovitch, I.: The dimension of semiorders. Journal of Combinatorial Theory\u00a0Series A(25), 50\u201361 (1978)","journal-title":"Journal of Combinatorial Theory"},{"key":"4_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"301","DOI":"10.1007\/3-540-61310-2_23","volume-title":"Integer Programming and Combinatorial Optimization","author":"A.S. Schulz","year":"1996","unstructured":"Schulz, A.S.: Scheduling to minimize total weighted completion time: Performance guarantees of LP-based heuristics and lower bounds. In: Cunningham, W.H., Queyranne, M., McCormick, S.T. (eds.) IPCO 1996. LNCS, vol.\u00a01084, pp. 301\u2013315. Springer, Heidelberg (1996)"},{"issue":"5","key":"4_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(5), 203\u2013213 (1999)","journal-title":"Journal of Scheduling"},{"key":"4_CR22","doi-asserted-by":"crossref","unstructured":"Trotter, W.T.: Combinatorics and Partially Ordered Sets: Dimension Theory. Johns Hopkins Series in the Mathematical Sciences. The Johns Hopkins University Press (1992)","DOI":"10.56021\/9780801844256"},{"key":"4_CR23","doi-asserted-by":"crossref","unstructured":"Trotter, W.T.: New perspectives on interval orders and interval graphs. In: Bailey, R.A. (ed.) Surveys in Combinatorics, London. Mathematical Society Lecture Note Series, vol.\u00a0241, pp. 237\u2013286 (1997)","DOI":"10.1017\/CBO9780511662119.009"},{"issue":"1","key":"4_CR24","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1016\/S0166-218X(02)00427-4","volume":"131","author":"G.J. Woeginger","year":"2003","unstructured":"Woeginger, G.J.: On the approximability of average completion time scheduling under precedence constraints. Discrete Applied Mathematics\u00a0131(1), 237\u2013252 (2003)","journal-title":"Discrete Applied Mathematics"},{"issue":"3","key":"4_CR25","doi-asserted-by":"publisher","first-page":"351","DOI":"10.1137\/0603036","volume":"22","author":"M. Yannakakis","year":"1982","unstructured":"Yannakakis, M.: On the complexity of partial order dimension problem. SIAM Journal on Algebraic and Discrete Methods\u00a022(3), 351\u2013358 (1982)","journal-title":"SIAM Journal on Algebraic and Discrete Methods"}],"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\/11830924_4.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,8]],"date-time":"2023-05-08T16:21:20Z","timestamp":1683562880000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11830924_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540380443","9783540380450"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/11830924_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}