{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,7]],"date-time":"2026-06-07T08:48:19Z","timestamp":1780822099436,"version":"3.54.1"},"publisher-location":"Cham","reference-count":16,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319449135","type":"print"},{"value":"9783319449142","type":"electronic"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-44914-2_9","type":"book-chapter","created":{"date-parts":[[2016,11,29]],"date-time":"2016-11-29T16:56:02Z","timestamp":1480438562000},"page":"105-120","source":"Crossref","is-referenced-by-count":16,"title":["Precedence-Constrained Scheduling Problems Parameterized by Partial Order Width"],"prefix":"10.1007","author":[{"given":"Ren\u00e9","family":"van Bevern","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Robert","family":"Bredereck","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Laurent","family":"Bulteau","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Christian","family":"Komusiewicz","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Nimrod","family":"Talmon","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Gerhard J.","family":"Woeginger","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2016,9,10]]},"reference":[{"issue":"2","key":"9_CR1","doi-asserted-by":"crossref","first-page":"244","DOI":"10.1287\/opre.4.2.244","volume":"4","author":"SB Akers Jr","year":"1956","unstructured":"Akers Jr., S.B.: A graphical approach to production scheduling problems. Oper. Res. 4(2), 244\u2013245 (1956)","journal-title":"Oper. Res."},{"issue":"1","key":"9_CR2","first-page":"4","volume":"12","author":"R Bevern van","year":"2016","unstructured":"van Bevern, R.: Fixed-parameter algorithms in operations research: opportunities and challenges. Parameterized Complex. News 12(1), 4\u20136 (2016)","journal-title":"Parameterized Complex. News"},{"issue":"2","key":"9_CR3","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1016\/0167-6377(95)00031-9","volume":"18","author":"HL Bodlaender","year":"1995","unstructured":"Bodlaender, H.L., Fellows, M.R.: W[2]-hardness of precedence constrained $$k$$ -processor scheduling. Oper. Res. Lett. 18(2), 93\u201397 (1995)","journal-title":"Oper. Res. Lett."},{"key":"9_CR4","doi-asserted-by":"crossref","unstructured":"Cygan, M., et al.: Parameterized Algorithms. Springer, Amsterdam (2015)","DOI":"10.1007\/978-3-319-21275-3"},{"key":"9_CR5","doi-asserted-by":"crossref","unstructured":"Downey, R.G., Fellows, M.R.: Fundamentals of Parameterized Complexity. Springer, Heidelberg (2013)","DOI":"10.1007\/978-1-4471-5559-1"},{"issue":"2","key":"9_CR6","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1016\/0890-5401(91)90009-Q","volume":"92","author":"J Du","year":"1991","unstructured":"Du, J., Leung, J.Y.T., Young, G.H.: Scheduling chain-structured tasks to minimize makespan and mean flow time. Inform. Comput. 92(2), 219\u2013236 (1991)","journal-title":"Inform. Comput."},{"issue":"4","key":"9_CR7","doi-asserted-by":"crossref","first-page":"351","DOI":"10.1023\/B:ORDE.0000034609.99940.fb","volume":"20","author":"S Felsner","year":"2003","unstructured":"Felsner, S., Raghavan, V., Spinrad, J.: Recognition algorithms for orders of small width and graphs of small Dilworth number. Order 20(4), 351\u2013364 (2003)","journal-title":"Order"},{"key":"9_CR8","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"MR Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, New York (1979)"},{"issue":"6","key":"9_CR9","doi-asserted-by":"crossref","first-page":"889","DOI":"10.1287\/opre.11.6.889","volume":"11","author":"WW Hardgrave","year":"1963","unstructured":"Hardgrave, W.W., Nemhauser, G.L.: A geometric model and a graphical algorithm for a sequencing problem. Oper. Res. 11(6), 889\u2013900 (1963)","journal-title":"Oper. Res."},{"issue":"1","key":"9_CR10","doi-asserted-by":"crossref","first-page":"22","DOI":"10.1287\/opre.26.1.22","volume":"26","author":"JK Lenstra","year":"1978","unstructured":"Lenstra, J.K., Rinnooy Kan, A.H.G.: Complexity of scheduling under precedence constraints. Oper. Res. 26(1), 22\u201335 (1978)","journal-title":"Oper. Res."},{"issue":"1\u20132","key":"9_CR11","doi-asserted-by":"crossref","first-page":"533","DOI":"10.1007\/s10107-014-0830-9","volume":"154","author":"M Mnich","year":"2015","unstructured":"Mnich, M., Wiese, A.: Scheduling and fixed-parameter tractability. Math. Program. 154(1\u20132), 533\u2013562 (2015)","journal-title":"Math. Program."},{"key":"9_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1007\/978-3-642-38536-0_21","volume-title":"Computer Science \u2013 Theory and Applications","author":"Romeo Rizzi","year":"2013","unstructured":"Rizzi, Romeo, Vialette, St\u00e9phane: On recognizing words that are squares for the shuffle product. In: Bulatov, Andrei A., Shur, Arseny M. (eds.) CSR 2013. LNCS, vol. 7913, pp. 235\u2013245. Springer, Heidelberg (2013)"},{"key":"9_CR13","doi-asserted-by":"crossref","unstructured":"Schwindt, C., Zimmermann, J. (eds.): Handbook on Project Management and Scheduling. International Handbooks on Information Systems. Springer, Heidelberg (2015)","DOI":"10.1007\/978-3-319-05915-0"},{"issue":"1","key":"9_CR14","first-page":"75","volume":"7","author":"VV Servakh","year":"2000","unstructured":"Servakh, V.V.: Effektivno razreshimy sluchaj zadachi kalendarnogo planirovaniya s vozobnovimymi resursami. Diskretn. Anal. Issled. Oper. 7(1), 75\u201382 (2000)","journal-title":"Diskretn. Anal. Issled. Oper."},{"issue":"3","key":"9_CR15","doi-asserted-by":"crossref","first-page":"384","DOI":"10.1016\/S0022-0000(75)80008-0","volume":"10","author":"J Ullman","year":"1975","unstructured":"Ullman, J.: NP-complete scheduling problems. J. Comput. Syst. Sci. 10(3), 384\u2013393 (1975)","journal-title":"J. Comput. Syst. Sci."},{"issue":"3","key":"9_CR16","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1016\/0022-0000(84)90018-7","volume":"28","author":"MK Warmuth","year":"1984","unstructured":"Warmuth, M.K., Haussler, D.: On the complexity of iterated shuffle. J. Comput. Syst. Sci. 28(3), 345\u2013358 (1984)","journal-title":"J. Comput. Syst. Sci."}],"container-title":["Lecture Notes in Computer Science","Discrete Optimization and Operations Research"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-44914-2_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,15]],"date-time":"2019-09-15T22:38:17Z","timestamp":1568587097000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-44914-2_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319449135","9783319449142"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-44914-2_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016]]}}}