{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,6]],"date-time":"2026-05-06T16:39:26Z","timestamp":1778085566347,"version":"3.51.4"},"reference-count":41,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"funder":[{"DOI":"10.13039\/100000104","name":"Jet Propulsion Laboratory, California Institute of Technology, under a Contract with the National Aeronautics and Space Administration","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100000104","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2021]]},"DOI":"10.1109\/access.2021.3064928","type":"journal-article","created":{"date-parts":[[2021,3,9]],"date-time":"2021-03-09T21:29:07Z","timestamp":1615325347000},"page":"39985-39994","source":"Crossref","is-referenced-by-count":8,"title":["Deep Space Network Scheduling via Mixed-Integer Linear Programming"],"prefix":"10.1109","volume":"9","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5618-0253","authenticated-orcid":false,"given":"Alex","family":"Sabol","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7957-6755","authenticated-orcid":false,"given":"Ryan","family":"Alimo","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7204-0296","authenticated-orcid":false,"given":"Farhad","family":"Kamangar","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9246-2357","authenticated-orcid":false,"given":"Ramtin","family":"Madani","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2019.2934148"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1016\/j.ress.2019.03.016"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1016\/S0004-3702(99)00069-7"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1051\/0004-6361:20030319"},{"key":"ref31","article-title":"Automated telescope scheduling","author":"johnston","year":"1988"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1023\/B:JOSH.0000013053.32600.3c"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1007\/s42405-019-00151-y"},{"key":"ref36","article-title":"Ensemble of heuristic and exact algorithm based on the divide and conquer framework for multi-satellite observation scheduling","author":"wu","year":"2020","journal-title":"arXiv 2007 03644"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2018.11.058"},{"key":"ref34","first-page":"813","article-title":"Using iterative repair to automate planning and scheduling of shuttle payload operations","author":"rabideau","year":"1999","journal-title":"Proc AAAI\/IAAI"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/AERO.2007.352900"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1109\/TAES.2020.2966902"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1080\/10798587.2008.10643001"},{"key":"ref12","first-page":"1","article-title":"Request-driven scheduling for NASA’s deep space network","author":"johnston","year":"2009","journal-title":"Proc Int Workshop Planning Scheduling for Space (IWPSS)"},{"key":"ref13","first-page":"2578","article-title":"Spacecraft block scheduling for NASA’s deep space network","author":"hackett","year":"2018","journal-title":"Proc Space Ops"},{"key":"ref14","first-page":"422","article-title":"An optimal spacecraft scheduling model for the NASA deep space network","volume":"38","author":"webb","year":"1985","journal-title":"J Brit Interplanetary Soc"},{"key":"ref15","first-page":"667","article-title":"Towards automated scheduling of NASA’s deep space network: A mixed integer linear programming approach","author":"sabol","year":"2021","journal-title":"Proc AIAA SciTech Forum"},{"key":"ref16","volume":"174","author":"garey","year":"1979","journal-title":"Computers and Intractability"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.23919\/ACC.2019.8815148"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1016\/j.sysarc.2019.101706"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TIE.2020.2978707"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1007\/s10462-004-1286-8"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.2514\/6.2018-2502"},{"key":"ref27","first-page":"383","article-title":"Scheduling meetings using distributed valued constraint satisfaction algorithm","author":"tsuruta","year":"2000","journal-title":"Proc ECAI"},{"key":"ref3","article-title":"Automating mid- and long-range scheduling for NASA’s deep space network","author":"johnston","year":"2012","journal-title":"Proc SpaceOps Conf"},{"key":"ref6","article-title":"Nasa’s management of the deep space network","year":"2015"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1007\/s11590-014-0744-8"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1002\/9781119169079"},{"key":"ref8","first-page":"181","article-title":"Aspen: A framework for automated planning and scheduling of spacecraft control and operations","author":"fukunaga","year":"1997","journal-title":"Proc Int Symp AI Robot Automat Space"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1117\/12.141750"},{"key":"ref2","volume":"1","author":"imbriale","year":"2005","journal-title":"Large Antennas of the Deep Space Network"},{"key":"ref9","first-page":"1","article-title":"Aspen–automated planning and scheduling for space mission operations","author":"chien","year":"2000","journal-title":"Proc Space Ops"},{"key":"ref1","first-page":"2375","article-title":"Achieving fast operational intelligence in NASA’s deep space network through complex event processing","author":"choi","year":"2016","journal-title":"Proc 14th Int Conf Space Oper"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1016\/j.jclepro.2018.11.021"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1016\/j.compchemeng.2018.10.001"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1080\/00207543.2019.1636324"},{"key":"ref24","doi-asserted-by":"crossref","first-page":"760","DOI":"10.1057\/palgrave.jors.2601736","article-title":"New heuristics for over-constrained flight to gate assignments","volume":"55","author":"ding","year":"2004","journal-title":"J Oper Res Soc"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1016\/j.ast.2017.11.009"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1021\/acs.iecr.8b06490"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1016\/j.jpdc.2004.03.015"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/12.620484"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6287639\/9312710\/09373338.pdf?arnumber=9373338","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,12,17]],"date-time":"2021-12-17T19:55:03Z","timestamp":1639770903000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9373338\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"references-count":41,"URL":"https:\/\/doi.org\/10.1109\/access.2021.3064928","relation":{},"ISSN":["2169-3536"],"issn-type":[{"value":"2169-3536","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021]]}}}