{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,10]],"date-time":"2026-03-10T13:49:01Z","timestamp":1773150541589,"version":"3.50.1"},"reference-count":9,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2005,4,1]],"date-time":"2005-04-01T00:00:00Z","timestamp":1112313600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Sched"],"published-print":{"date-parts":[[2005,4]]},"DOI":"10.1007\/s10951-005-6363-6","type":"journal-article","created":{"date-parts":[[2005,4,6]],"date-time":"2005-04-06T14:44:49Z","timestamp":1112798689000},"page":"135-143","source":"Crossref","is-referenced-by-count":5,"title":["The k-Track Assignment Problem on Partial Orders"],"prefix":"10.1007","volume":"8","author":[{"given":"Paulo","family":"Barcia","sequence":"first","affiliation":[]},{"given":"J. Orestes","family":"Cerdeira","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"CR1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0166-218X(87)90037-0","volume":"18","author":"E. M. Arkin","year":"1987","unstructured":"Arkin, E. M. and E. B. Silverberg, ?Scheduling jobs with fixed start and end times? Discrete Applied Mathematics, 18, 1?8 (1987).","journal-title":"Discrete Applied Mathematics"},{"key":"CR2","doi-asserted-by":"crossref","first-page":"341","DOI":"10.1016\/S0167-6377(03)00023-3","volume":"31","author":"P. Barcia","year":"2003","unstructured":"Barcia, P. and J. O. Cerdeira, ?Node packings on cocomparability graphs? Operations Research Letters, 31, 341?342 (2003).","journal-title":"Operations Research Letters"},{"key":"CR3","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1007\/BF02238071","volume":"52","author":"P. Brucker","year":"1994","unstructured":"Brucker, P. and L. Nordmann, ?The k-track assignment problem? Computing, 52, 97?122 (1994).","journal-title":"Computing"},{"key":"CR4","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1016\/0166-218X(95)00112-5","volume":"58","author":"U. Faigle","year":"1995","unstructured":"Faigle, U. and W. M. Nawijn, ?Note on scheduling intervals on-line? Discrete Applied Mathematics, 58, 13?17 (1995).","journal-title":"Discrete Applied Mathematics"},{"key":"CR5","doi-asserted-by":"crossref","first-page":"196","DOI":"10.1006\/jagm.1998.1001","volume":"31","author":"U. Faigle","year":"1999","unstructured":"Faigle, U., W. Kern, and W. M. Nawijn, ?A greedy on-line algorithm for the k-track assignment problem? Journal of Algorithms, 31, 196?210 (1999).","journal-title":"Journal of Algorithms"},{"key":"CR6","doi-asserted-by":"crossref","unstructured":"Golumbic, M. C., Algorithmic Graph Theory and Perfect Graphs. Academic Press, 1980.","DOI":"10.1016\/B978-0-12-289260-8.50010-8"},{"key":"CR7","unstructured":"Kolen, A. W. J. and J. K. Lenstra, ?Combinatorics in operations research? in R. L. Graham, M. Grotschel, and L. Lovasz (eds.), Handbook of Combinatorics, Vol. II, Elsevier, 1995, pp. 1875?1910."},{"key":"CR8","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1016\/0167-6377(91)90028-N","volume":"10","author":"R. K. Martin","year":"1991","unstructured":"Martin, R. K., ?Using separation algorithms to generate mixed integer models reformulations? Operations Research Letters, 10, 119?128 (1991).","journal-title":"Operations Research Letters"},{"key":"CR9","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1007\/BF01580121","volume":"5","author":"M. W. Padberg","year":"1973","unstructured":"Padberg, M. W., ?On the facial structure of set packing polyhedra? Mathematical Programming, 5, 199?215 (1973).","journal-title":"Mathematical Programming"}],"container-title":["Journal of Scheduling"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-005-6363-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10951-005-6363-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-005-6363-6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,6]],"date-time":"2020-04-06T18:01:51Z","timestamp":1586196111000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10951-005-6363-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,4]]},"references-count":9,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2005,4]]}},"alternative-id":["6363"],"URL":"https:\/\/doi.org\/10.1007\/s10951-005-6363-6","relation":{},"ISSN":["1094-6136","1099-1425"],"issn-type":[{"value":"1094-6136","type":"print"},{"value":"1099-1425","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005,4]]}}}