{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,7]],"date-time":"2025-10-07T14:36:58Z","timestamp":1759847818528},"publisher-location":"Berlin, Heidelberg","reference-count":32,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540727910"},{"type":"electronic","value":"9783540727927"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-72792-7_11","type":"book-chapter","created":{"date-parts":[[2007,6,25]],"date-time":"2007-06-25T08:07:11Z","timestamp":1182758831000},"page":"130-144","source":"Crossref","is-referenced-by-count":9,"title":["Scheduling with Precedence Constraints of Low Fractional Dimension"],"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":"Nikolaus","family":"Mutsanas","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ola","family":"Svensson","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"1-2","key":"11_CR1","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1016\/S0304-3975(98)00158-3","volume":"237","author":"P. Alimonti","year":"2000","unstructured":"Alimonti, P., Kann, V.: Some APX-completeness results for cubic graphs. Theor. Comput. Sci.\u00a0237(1-2), 123\u2013134 (2000)","journal-title":"Theor. Comput. Sci."},{"key":"11_CR2","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)"},{"key":"11_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1007\/11830924_4","volume-title":"Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques","author":"C. Amb\u00fchl","year":"2006","unstructured":"Amb\u00fchl, C., Mastrolilli, M., Svensson, O.: Approximating precedence-constrained single machine scheduling by coloring. In: D\u00edaz, J., Jansen, K., Rolim, J.D.P., Zwick, U. (eds.) APPROX 2006 and RANDOM 2006. LNCS, vol.\u00a04110, pp. 15\u201326. Springer, Heidelberg (2006)"},{"key":"11_CR4","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1007\/BF00814406","volume":"9","author":"G.R. Brightwell","year":"1992","unstructured":"Brightwell, G.R., Scheinerman, E.R.: Fractional dimension of partial orders. Order\u00a09, 139\u2013158 (1992)","journal-title":"Order"},{"issue":"1-2","key":"11_CR5","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":"11_CR6","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"},{"key":"11_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"283","DOI":"10.1007\/978-3-540-25960-2_22","volume-title":"Integer Programming and Combinatorial Optimization","author":"J.R. Correa","year":"2004","unstructured":"Correa, J.R., Schulz, A.S.: Single machine scheduling with precedence constraints. In: Bienstock, D., Nemhauser, G.L. (eds.) IPCO 2004. LNCS, vol.\u00a03064, pp. 283\u2013297. Springer, Heidelberg (2004)"},{"key":"11_CR8","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1016\/0012-365X(94)00109-V","volume":"136","author":"S. Felsner","year":"1994","unstructured":"Felsner, S., Trotter, W.T.: On the fractional dimension of partially ordered sets. DMATH: Discrete Mathematics\u00a0136, 101\u2013117 (1994)","journal-title":"DMATH: Discrete Mathematics"},{"issue":"2","key":"11_CR9","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"},{"key":"11_CR10","volume-title":"Interval Orders and Interval Graphs","author":"P.C. Fishburn","year":"1985","unstructured":"Fishburn, P.C.: Interval Orders and Interval Graphs. John Wiley and Sons, Chichester (1985)"},{"issue":"3","key":"11_CR11","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1016\/0304-3975(76)90059-1","volume":"1","author":"M.R. Garey","year":"1976","unstructured":"Garey, M.R., Johnson, D.S., Stockmeyer, L.J.: Some simplified NP-complete graph problems. Theor. Comput. Sci.\u00a01(3), 237\u2013267 (1976)","journal-title":"Theor. Comput. Sci."},{"key":"11_CR12","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1016\/S0167-5060(08)70356-X","volume":"5","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. Annals of Discrete Mathematics\u00a05, 287\u2013326 (1979)","journal-title":"Annals of Discrete Mathematics"},{"key":"11_CR13","doi-asserted-by":"crossref","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":"11_CR14","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":"11_CR15","unstructured":"Jain, K., Hedge, R.: Some inapproximability results for the (fractional) poset dimension. Personal communication (2006)"},{"key":"11_CR16","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":"11_CR17","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":"11_CR18","doi-asserted-by":"crossref","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":"2","key":"11_CR19","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1006\/jagm.1994.1034","volume":"17","author":"T.-H. Ma","year":"1994","unstructured":"Ma, T.-H., Spinrad, J.P.: On the 2-chain subgraph cover and related problems. J. Algorithms\u00a017(2), 251\u2013268 (1994)","journal-title":"J. Algorithms"},{"issue":"6","key":"11_CR20","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":"11_CR21","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 Publishers, Dordrecht (1989)"},{"key":"11_CR22","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1007\/BF01580222","volume":"6","author":"G.L. Nemhauser","year":"1973","unstructured":"Nemhauser, G.L., Trotter, L.E.: Properties of vertex packing and independence system polyhedra. Mathematical Programming\u00a06, 48\u201361 (1973)","journal-title":"Mathematical Programming"},{"key":"11_CR23","doi-asserted-by":"publisher","first-page":"232","DOI":"10.1007\/BF01580444","volume":"8","author":"G.L. Nemhauser","year":"1975","unstructured":"Nemhauser, G.L., Trotter, L.E.: Vertex packings: Structural properties and algorithms. Mathematical Programming\u00a08, 232\u2013248 (1975)","journal-title":"Mathematical Programming"},{"key":"11_CR24","doi-asserted-by":"publisher","first-page":"405","DOI":"10.1137\/0208031","volume":"8","author":"C.H. Papadimitriou","year":"1979","unstructured":"Papadimitriou, C.H., Yannakakis, M.: Scheduling interval-ordered tasks. SIAM Journal of Computing\u00a08, 405\u2013409 (1979)","journal-title":"SIAM Journal of Computing"},{"issue":"3","key":"11_CR25","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":"11_CR26","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1016\/0097-3165(78)90030-4","volume":"25","author":"I. Rabinovitch","year":"1978","unstructured":"Rabinovitch, I.: The dimension of semiorders. J. Comb. Theory, Ser. A\u00a025, 50\u201361 (1978)","journal-title":"J. Comb. Theory, Ser. A"},{"key":"11_CR27","volume-title":"Fractional Graph Theory","author":"E.R. Scheinerman","year":"1997","unstructured":"Scheinerman, E.R., Ullman, D.H.: Fractional Graph Theory. John Wiley and Sons, Chichester (1997)"},{"key":"11_CR28","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":"11_CR29","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":"11_CR30","first-page":"349","volume":"22","author":"J. Spencer","year":"1971","unstructured":"Spencer, J.: On minimum scrambling sets of simple orders. Acta Mathematica\u00a022, 349\u2013353 (1971)","journal-title":"Acta Mathematica"},{"key":"11_CR31","series-title":"Johns Hopkins Series in the Mathematical Sciences","doi-asserted-by":"crossref","DOI":"10.56021\/9780801844256","volume-title":"Combinatorics and Partially Ordered Sets: Dimension Theory","author":"W.T. Trotter","year":"1992","unstructured":"Trotter, W.T.: Combinatorics and Partially Ordered Sets: Dimension Theory. Johns Hopkins Series in the Mathematical Sciences. The Johns Hopkins University, Baltimore (1992)"},{"issue":"1","key":"11_CR32","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"}],"container-title":["Lecture Notes in Computer Science","Integer Programming and Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-72792-7_11.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,12]],"date-time":"2023-05-12T10:58:24Z","timestamp":1683889104000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-72792-7_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540727910","9783540727927"],"references-count":32,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-72792-7_11","relation":{},"subject":[]}}