{"id":"https://openalex.org/W98269856","doi":"https://doi.org/10.1090/dimacs/057/06","title":"A constraint-based approach to satellite scheduling","display_name":"A constraint-based approach to satellite scheduling","publication_year":2001,"publication_date":"2001-02-27","ids":{"openalex":"https://openalex.org/W98269856","doi":"https://doi.org/10.1090/dimacs/057/06","mag":"98269856"},"language":"en","primary_location":{"id":"doi:10.1090/dimacs/057/06","is_oa":false,"landing_page_url":"https://doi.org/10.1090/dimacs/057/06","pdf_url":null,"source":{"id":"https://openalex.org/S4210177973","display_name":"DIMACS series in discrete mathematics and theoretical computer science","issn_l":"1052-1798","issn":["1052-1798","2472-4793"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"DIMACS Series in Discrete Mathematics and Theoretical Computer Science","raw_type":"book-chapter"},"type":"book-chapter","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5042002842","display_name":"Joseph C. Pemberton","orcid":null},"institutions":[{"id":"https://openalex.org/I161057412","display_name":"University of New Hampshire","ror":"https://ror.org/01rmh9n78","country_code":"US","type":"education","lineage":["https://openalex.org/I161057412"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Joseph Pemberton","raw_affiliation_strings":["University of New Hampshire, Durham, NH"],"affiliations":[{"raw_affiliation_string":"University of New Hampshire, Durham, NH","institution_ids":["https://openalex.org/I161057412"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5098405458","display_name":"Galiber","orcid":null},"institutions":[{"id":"https://openalex.org/I161057412","display_name":"University of New Hampshire","ror":"https://ror.org/01rmh9n78","country_code":"US","type":"education","lineage":["https://openalex.org/I161057412"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Galiber","raw_affiliation_strings":["University of New Hampshire, Durham, NH"],"affiliations":[{"raw_affiliation_string":"University of New Hampshire, Durham, NH","institution_ids":["https://openalex.org/I161057412"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5042002842"],"corresponding_institution_ids":["https://openalex.org/I161057412"],"apc_list":null,"apc_paid":null,"fwci":0.6876,"has_fulltext":false,"cited_by_count":62,"citation_normalized_percentile":{"value":0.6900777,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"101","last_page":"114"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9983999729156494,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9983999729156494,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12401","display_name":"Scheduling and Timetabling Solutions","score":0.9937000274658203,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T12042","display_name":"Satellite Communication Systems","score":0.9879999756813049,"subfield":{"id":"https://openalex.org/subfields/2202","display_name":"Aerospace Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6578187942504883},{"id":"https://openalex.org/keywords/satellite","display_name":"Satellite","score":0.5620905756950378},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.5451896786689758},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.4602232575416565},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.3220985531806946},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.28710898756980896},{"id":"https://openalex.org/keywords/aerospace-engineering","display_name":"Aerospace engineering","score":0.17210975289344788},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.13946878910064697},{"id":"https://openalex.org/keywords/engineering","display_name":"Engineering","score":0.1299968957901001},{"id":"https://openalex.org/keywords/mechanical-engineering","display_name":"Mechanical engineering","score":0.045548707246780396}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6578187942504883},{"id":"https://openalex.org/C19269812","wikidata":"https://www.wikidata.org/wiki/Q26540","display_name":"Satellite","level":2,"score":0.5620905756950378},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5451896786689758},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.4602232575416565},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.3220985531806946},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.28710898756980896},{"id":"https://openalex.org/C146978453","wikidata":"https://www.wikidata.org/wiki/Q3798668","display_name":"Aerospace engineering","level":1,"score":0.17210975289344788},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.13946878910064697},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.1299968957901001},{"id":"https://openalex.org/C78519656","wikidata":"https://www.wikidata.org/wiki/Q101333","display_name":"Mechanical engineering","level":1,"score":0.045548707246780396}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1090/dimacs/057/06","is_oa":false,"landing_page_url":"https://doi.org/10.1090/dimacs/057/06","pdf_url":null,"source":{"id":"https://openalex.org/S4210177973","display_name":"DIMACS series in discrete mathematics and theoretical computer science","issn_l":"1052-1798","issn":["1052-1798","2472-4793"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"DIMACS Series in Discrete Mathematics and Theoretical Computer Science","raw_type":"book-chapter"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":7,"referenced_works":["https://openalex.org/W4326551","https://openalex.org/W23603061","https://openalex.org/W79966361","https://openalex.org/W181575250","https://openalex.org/W1827136749","https://openalex.org/W2145490775","https://openalex.org/W2610826712"],"related_works":["https://openalex.org/W2748952813","https://openalex.org/W2390279801","https://openalex.org/W2358668433","https://openalex.org/W2376932109","https://openalex.org/W2001405890","https://openalex.org/W2382290278","https://openalex.org/W2350741829","https://openalex.org/W2530322880","https://openalex.org/W1596801655","https://openalex.org/W2359140296"],"abstract_inverted_index":{"Satellite":[0],"scheduling,":[1,4,66],"like":[2],"all":[3],"is":[5],"the":[6,43,52,58,70],"problem":[7,59],"of":[8],"mapping":[9],"tasks":[10],"(observation,":[11],"communication,":[12],"downlink,":[13],"control":[14],"maneuvers,":[15],"etc.)":[16],"to":[17,42,64,77],"resources":[18],"(sensor":[19],"satellites,":[20,22],"relay":[21],"ground":[23],"stations,":[24],"etc.).":[25],"Through":[26],"our":[27],"work":[28],"on":[29],"satellite":[30,53,65],"scheduling":[31,55],"problems,":[32],"we":[33,49,74],"have":[34,75],"encountered":[35],"many":[36],"different":[37],"constraints":[38,60],"that":[39,61,73],"are":[40,62],"particular":[41,63],"satellite-scheduling":[44],"domain.":[45],"In":[46],"this":[47],"paper,":[48],"will":[50],"introduce":[51],"mission-operation":[54],"problem,":[56],"describing":[57],"and":[67],"then":[68],"present":[69],"constraint-based":[71],"techniques":[72],"used":[76],"address":[78],"these":[79],"problems.":[80]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":3},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":6},{"year":2018,"cited_by_count":5},{"year":2017,"cited_by_count":4},{"year":2016,"cited_by_count":3},{"year":2015,"cited_by_count":4},{"year":2014,"cited_by_count":6},{"year":2013,"cited_by_count":7},{"year":2012,"cited_by_count":5}],"updated_date":"2026-04-07T06:01:17.266235","created_date":"2025-10-10T00:00:00"}