{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T12:35:29Z","timestamp":1759667729339},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2007,6,15]],"date-time":"2007-06-15T00:00:00Z","timestamp":1181865600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2008,5]]},"DOI":"10.1007\/s10878-007-9086-0","type":"journal-article","created":{"date-parts":[[2007,6,14]],"date-time":"2007-06-14T15:35:44Z","timestamp":1181835344000},"page":"342-356","source":"Crossref","is-referenced-by-count":5,"title":["Partitioning a weighted partial order"],"prefix":"10.1007","volume":"15","author":[{"given":"Linda S.","family":"Moonen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Frits C. R.","family":"Spieksma","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2007,6,15]]},"reference":[{"key":"9086_CR1","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-58412-1","volume-title":"Complexity and approximation: combinatorial optimization problems and their approximability properties","author":"G Ausiello","year":"1999","unstructured":"Ausiello G, Crescenzi P, Gambosi G, Kann V, Marchetti-Spaccamela A, Protasi M (1999) Complexity and approximation: combinatorial optimization problems and their approximability properties. Springer, Berlin"},{"key":"9086_CR2","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1016\/0304-3975(96)00031-X","volume":"162","author":"BS Baker","year":"1996","unstructured":"Baker BS, Coffman EG Jr (1996) Mutual exclusion scheduling. Theor Comput Sci 162:225\u2013245","journal-title":"Theor Comput Sci"},{"key":"9086_CR3","doi-asserted-by":"crossref","unstructured":"Bodlaender HL, Jansen K (1993) On the complexity of scheduling incompatible jobs with unit-times. In: Borzyszkowski AM, Sokolowski S (eds) Mathematical foundations of computer science, 18th international symposium, Gdansk, Poland, 30 August\u20133 September 1993. Lecture notes in computer science, vol 711, pp\u00a0291\u2013300","DOI":"10.1007\/3-540-57182-5_21"},{"key":"9086_CR4","doi-asserted-by":"crossref","first-page":"513","DOI":"10.1007\/s001860300273","volume":"57","author":"M Boudhar","year":"2003","unstructured":"Boudhar M (2003) Scheduling a batch processing machine with bipartite compatibility graphs. Math Methods Oper Res 57:513\u2013527","journal-title":"Math Methods Oper Res"},{"issue":"3","key":"9086_CR5","doi-asserted-by":"crossref","first-page":"713","DOI":"10.1137\/S0097539700382820","volume":"35","author":"C Chekuri","year":"2005","unstructured":"Chekuri C, Khanna S (2005) A PTAS for the multiple knapsack problem. SIAM J Comput 35(3):713\u2013728","journal-title":"SIAM J Comput"},{"key":"9086_CR6","doi-asserted-by":"crossref","first-page":"161","DOI":"10.2307\/1969503","volume":"51","author":"RP Dilworth","year":"1950","unstructured":"Dilworth RP (1950) A decomposition theorem for partially ordered sets. Ann Math 51:161\u2013166","journal-title":"Ann Math"},{"key":"9086_CR7","unstructured":"Finke G, Jost V, Queyranne M (2004) Batch processing with interval graph compatibilities between tasks. In: Proceedings of discrete optimization methods in production and logistics"},{"key":"9086_CR8","volume-title":"Algorithmic graph theory and perfect graphs","author":"MC Golumbic","year":"1980","unstructured":"Golumbic MC (1980) Algorithmic graph theory and perfect graphs. Academic Press, New York"},{"key":"9086_CR9","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1016\/0012-365X(93)90165-P","volume":"111","author":"P Hansen","year":"1993","unstructured":"Hansen P, Hertz A, Kuplinsky J (1993) Bounded vertex colorings of graphs. Discret Math 111:305\u2013312","journal-title":"Discret Math"},{"key":"9086_CR10","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1016\/S0890-5401(02)00028-7","volume":"180","author":"K Jansen","year":"2003","unstructured":"Jansen K (2003) The mutual exclusion scheduling problem for permutation and comparability graphs. Inf Comput 180:71\u201381","journal-title":"Inf Comput"},{"key":"9086_CR11","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1016\/S0012-365X(00)00345-9","volume":"232","author":"M Jarvis","year":"2001","unstructured":"Jarvis M, Zhou B (2001) Bounded vertex coloring of trees. Discret Math 232:145\u2013151","journal-title":"Discret Math"},{"issue":"1","key":"9086_CR12","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1016\/0020-0190(91)90246-E","volume":"37","author":"V Kann","year":"1991","unstructured":"Kann V (1991) Maximum bounded 3-dimensional matching is MAX SNP-complete. Inf Process Lett 37(1):27\u201335","journal-title":"Inf Process Lett"},{"key":"9086_CR13","doi-asserted-by":"crossref","first-page":"455","DOI":"10.1287\/ijoc.1040.0124","volume":"18","author":"LS Moonen","year":"2006","unstructured":"Moonen LS, Spieksma FCR (2006) Exact algorithms for a loading problem with bounded clique width. INFORMS J Comput 18:455\u2013465","journal-title":"INFORMS J Comput"},{"key":"9086_CR14","doi-asserted-by":"crossref","unstructured":"Ore O (1962) Theory of graphs. American mathematical society colloquium publications, vol\u00a038. Providence","DOI":"10.1090\/coll\/038"},{"key":"9086_CR15","volume-title":"Computational complexity","author":"CH Papadimitriou","year":"1994","unstructured":"Papadimitriou CH (1994) Computational complexity. Addison\u2013Wesley, Reading"},{"key":"9086_CR16","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1007\/BF01202286","volume":"4","author":"E Petrank","year":"1994","unstructured":"Petrank E (1994) The hardness of approximation: gap location. Comput Complex 4:133\u2013157","journal-title":"Comput Complex"},{"key":"9086_CR17","doi-asserted-by":"crossref","first-page":"421","DOI":"10.1016\/0166-218X(95)00045-S","volume":"65","author":"H Shum","year":"1996","unstructured":"Shum H, Trotter LE Jr (1996) Cardinality-restricted chains and antichains in partially ordered sets. Discret Appl Math 65:421\u2013439","journal-title":"Discret Appl Math"},{"key":"9086_CR18","doi-asserted-by":"crossref","DOI":"10.56021\/9780801844256","volume-title":"Combinatorics and partially ordered sets: dimension theory","author":"WT Trotter","year":"1992","unstructured":"Trotter WT (1992) Combinatorics and partially ordered sets: dimension theory. The John Hopkins University Press, Baltimore"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-007-9086-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-007-9086-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-007-9086-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,12]],"date-time":"2023-05-12T11:21:17Z","timestamp":1683890477000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-007-9086-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,6,15]]},"references-count":18,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2008,5]]}},"alternative-id":["9086"],"URL":"https:\/\/doi.org\/10.1007\/s10878-007-9086-0","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007,6,15]]}}}