{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,16]],"date-time":"2026-03-16T17:04:33Z","timestamp":1773680673900,"version":"3.50.1"},"reference-count":5,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[1994,6,1]],"date-time":"1994-06-01T00:00:00Z","timestamp":770428800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computing"],"published-print":{"date-parts":[[1994,6]]},"DOI":"10.1007\/bf02238071","type":"journal-article","created":{"date-parts":[[2005,11,14]],"date-time":"2005-11-14T20:21:41Z","timestamp":1131999701000},"page":"97-122","source":"Crossref","is-referenced-by-count":19,"title":["Thek-track assignment problem","Dask-Track Zuordnungsproblem"],"prefix":"10.1007","volume":"52","author":[{"given":"P.","family":"Brucker","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"L.","family":"Nordmann","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"BF02238071_CR1","unstructured":"Hsu, M.-L., Tsai, K.-H.: A linear time algorithm for the two-track assignment problem. Proc. 27th Allerton Conference on Communication, Control and Computing, pp. 291\u2013300 (1989)."},{"key":"BF02238071_CR2","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., Silverberg, E. B.: Scheduling jobs with fixed start and end time. Discrete Appl Math18, 1\u20138 (1987).","journal-title":"Discrete Appl Math"},{"key":"BF02238071_CR3","unstructured":"Faigle, U., Nawijn, W. M.: Greedyk-coverings of interval orders. Working paper, Twente University (1991)"},{"key":"BF02238071_CR4","doi-asserted-by":"crossref","first-page":"216","DOI":"10.1137\/0601025","volume":"1","author":"M. R. Garey","year":"1980","unstructured":"Garey, M. R., Johnson, D. S., Miller, G. L., Papadimitriou, C. H.: The complexity of coloring circular arcs and cords. SIAM J. Algebraic Discrete Methods1, 216\u2013227 (1980).","journal-title":"SIAM J. Algebraic Discrete Methods"},{"key":"BF02238071_CR5","unstructured":"Kolen, A. W. J., Lenstra, J. K.: Interval scheduling. Technical Report No. 925, Cornel University Ithaca, pp. 23\u201325 (1990)."}],"container-title":["Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02238071.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02238071\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02238071","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,15]],"date-time":"2019-05-15T13:02:24Z","timestamp":1557925344000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF02238071"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,6]]},"references-count":5,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1994,6]]}},"alternative-id":["BF02238071"],"URL":"https:\/\/doi.org\/10.1007\/bf02238071","relation":{},"ISSN":["0010-485X","1436-5057"],"issn-type":[{"value":"0010-485X","type":"print"},{"value":"1436-5057","type":"electronic"}],"subject":[],"published":{"date-parts":[[1994,6]]}}}