{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T11:28:04Z","timestamp":1743074884635,"version":"3.40.3"},"publisher-location":"Dordrecht","reference-count":10,"publisher":"Springer Netherlands","isbn-type":[{"type":"print","value":"9789400769953"},{"type":"electronic","value":"9789400769960"}],"license":[{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-94-007-6996-0_14","type":"book-chapter","created":{"date-parts":[[2013,7,13]],"date-time":"2013-07-13T14:05:32Z","timestamp":1373724332000},"page":"131-139","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["A Hill Climbing Algorithm for Ground Station Scheduling"],"prefix":"10.1007","author":[{"given":"Fatos","family":"Xhafa","sequence":"first","affiliation":[]},{"given":"Xavier","family":"Herrero","sequence":"additional","affiliation":[]},{"given":"Admir","family":"Barolli","sequence":"additional","affiliation":[]},{"given":"Makoto","family":"Takizawa","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"14_CR1","doi-asserted-by":"crossref","unstructured":"Fischetti M, Martello S, Toth P (1992) Approximation algorithms for fixed schedule problems, Oper Res 40\/1:96-S108","DOI":"10.1287\/opre.40.1.S96"},{"key":"14_CR2","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1016\/0377-2217(94)90150-3","volume":"73","author":"K Jansen","year":"1994","unstructured":"Jansen K (1994) An approximation algorithm for the license and shift class design problem. Eur J Oper Res 73:127\u2013131","journal-title":"Eur J Oper Res"},{"key":"14_CR3","unstructured":"Kolen A, Lenstra JK, Papadimitriou C, Orlin J Interval scheduling problems, Manuscript, Center of Mathematics and Computer Science, C.W.I., Amsterdam"},{"key":"14_CR4","doi-asserted-by":"publisher","first-page":"138","DOI":"10.1016\/0377-2217(93)90014-E","volume":"64","author":"AWJ Kolen","year":"1993","unstructured":"Kolen AWJ, Kroon LG (1993) On the computational complexity of (maximum) shift class scheduling. Eur J Oper Res 64:138\u2013151","journal-title":"Eur J Oper Res"},{"key":"14_CR5","unstructured":"Pemberton JC, Greenwald L (2004) On the need for dynamic scheduling of imaging satellites. Proceedings of AAAI\u201904, pp 723\u2013728"},{"key":"14_CR6","unstructured":"Vaghei BG, Moghadam RA, Bagheri A, Sarkheyli A (2010) Scheduling earth observation activities in LEO satellites using graph coloring problem. In 2010 5th international symposium on telecommunications (IST), 4\u20136 Dec 2010, pp 928\u2013931"},{"key":"14_CR7","unstructured":"Harrison SA, Price ME, Philpott MS (1999) Task scheduling for satellite based imagery. In: The eighteenth workshop of the UK planning and scheduling, special interest group, University of Salford, UK"},{"key":"14_CR8","doi-asserted-by":"crossref","unstructured":"Barbulescu L, Howe A, Watson J, Whitley L (2002) Satellite range scheduling: a comparison of genetic, heuristic and local search. Parallel problem solving from Nature \u2013PPSN, VII: 611\u2013620","DOI":"10.1007\/3-540-45712-7_59"},{"key":"14_CR9","doi-asserted-by":"crossref","unstructured":"Sarkheyli A, Vaghei BG, Bagheri A (2010) New tabu search heuristic in scheduling earth observation satellites. In: Proceedings of 2nd international conference on software technology and engineering (ICSTE), pp V2-199\u2013V2-203","DOI":"10.1109\/ICSTE.2010.5608821"},{"key":"14_CR10","doi-asserted-by":"crossref","unstructured":"Xhafa F, Barolli A, Takizawa M (2013) Steady state genetic algorithm for ground station scheduling problem. In: IEEE 27th international conference on advanced information networking and applications, AINA-2013, Spain, 25\u201328 Mar 2013, pp 153\u2013160","DOI":"10.1109\/AINA.2013.147"}],"container-title":["Lecture Notes in Electrical Engineering","Information Technology Convergence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-94-007-6996-0_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,11]],"date-time":"2024-05-11T07:03:49Z","timestamp":1715411029000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-94-007-6996-0_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9789400769953","9789400769960"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-94-007-6996-0_14","relation":{},"ISSN":["1876-1100","1876-1119"],"issn-type":[{"type":"print","value":"1876-1100"},{"type":"electronic","value":"1876-1119"}],"subject":[],"published":{"date-parts":[[2013]]},"assertion":[{"value":"14 July 2013","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}