{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,11]],"date-time":"2024-07-11T11:19:55Z","timestamp":1720696795161},"reference-count":5,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1999,2,1]],"date-time":"1999-02-01T00:00:00Z","timestamp":917827200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["European Journal of Operational Research"],"published-print":{"date-parts":[[1999,2]]},"DOI":"10.1016\/s0377-2217(97)00408-6","type":"journal-article","created":{"date-parts":[[2003,4,5]],"date-time":"2003-04-05T00:21:01Z","timestamp":1049502061000},"page":"531-541","source":"Crossref","is-referenced-by-count":8,"title":["Using the generalized assignment problem in scheduling the ROSAT space telescope"],"prefix":"10.1016","volume":"112","author":[{"given":"J\u00f6rg","family":"Nowakovski","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Werner","family":"Schw\u00e4rzler","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Eberhard","family":"Triesch","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0377-2217(97)00408-6_BIB1","doi-asserted-by":"crossref","unstructured":"S.L. Snowden, J.H.M.M. Schmitt Mission planning with ROSAT, in: Di Ges\u00f9 et al. (Eds.), Data Analysis in Astronomy IV Plenum Press, New York, 1992","DOI":"10.1007\/978-1-4615-3388-7_14"},{"key":"10.1016\/S0377-2217(97)00408-6_BIB2","doi-asserted-by":"crossref","first-page":"1095","DOI":"10.1287\/mnsc.32.9.1095","article-title":"A multiplier adjustment method for the generalized assignment problem","volume":"32","author":"Fisher","year":"1986","journal-title":"Management Science"},{"key":"10.1016\/S0377-2217(97)00408-6_BIB3","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1016\/0167-6377(83)90035-4","article-title":"A property of assignment type mixed integer linear programming problems","volume":"2","author":"Benders","year":"1982","journal-title":"Operations Research Letters"},{"key":"10.1016\/S0377-2217(97)00408-6_BIB4","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1002\/1520-6750(199203)39:2<137::AID-NAV3220390202>3.0.CO;2-D","article-title":"A linear relaxation heuristic for the generalized assignment problem","volume":"39","author":"Trick","year":"1992","journal-title":"Naval Research Logistics"},{"key":"10.1016\/S0377-2217(97)00408-6_BIB5","unstructured":"E.L. Lawler, Combinatorial Optimization: Networks and Matroids, Holt, Rinehart & Winston, New York, 1976"}],"container-title":["European Journal of Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221797004086?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221797004086?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,22]],"date-time":"2019-04-22T23:50:57Z","timestamp":1555977057000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0377221797004086"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999,2]]},"references-count":5,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1999,2]]}},"alternative-id":["S0377221797004086"],"URL":"https:\/\/doi.org\/10.1016\/s0377-2217(97)00408-6","relation":{},"ISSN":["0377-2217"],"issn-type":[{"value":"0377-2217","type":"print"}],"subject":[],"published":{"date-parts":[[1999,2]]}}}