The Resource An Introduction to Optimal Satellite Range Scheduling, by Antonio Jose Vazquez Alvarez, Richard Scott Erwin, (electronic resource)

An Introduction to Optimal Satellite Range Scheduling, by Antonio Jose Vazquez Alvarez, Richard Scott Erwin, (electronic resource)

Label
An Introduction to Optimal Satellite Range Scheduling
Title
An Introduction to Optimal Satellite Range Scheduling
Statement of responsibility
by Antonio Jose Vazquez Alvarez, Richard Scott Erwin
Creator
Contributor
Author
Author
Subject
Language
  • eng
  • eng
Summary
The satellite range scheduling (SRS) problem, an important operations research problem in the aerospace industry consisting of allocating tasks among satellites and Earth-bound objects, is examined in this book. SRS principles and solutions are applicable to many areas, including: Satellite communications, where tasks are communication intervals between sets of satellites and ground stations Earth observation, where tasks are observations of spots on the Earth by satellites Sensor scheduling, where tasks are observations of satellites by sensors on the Earth. This self-contained monograph begins with a structured compendium of the problem and moves on to explain the optimal approach to the solution, which includes aspects from graph theory, set theory, game theory and belief networks. This book is accessible to students, professionals and researchers in a variety of fields, including: operations research, optimization, scheduling theory, dynamic programming and game theory. Taking account of the distributed, stochastic and dynamic variants of the problem, this book presents the optimal solution to the fixed interval SRS problem and how to migrate results into more complex cases. Reference algorithms and traditional algorithms for solving the scheduling problems are provided and compared with examples and simulations in practical scenarios
Member of
http://library.link/vocab/creatorName
Vazquez Alvarez, Antonio Jose
Dewey number
510
http://bibfra.me/vocab/relation/httpidlocgovvocabularyrelatorsaut
  • aOGTqPN7xLg
  • 10EzlOP_RD8
Language note
English
LC call number
  • QA315-316
  • QA402.3
  • QA402.5-QA402.6
Literary form
non fiction
Nature of contents
dictionaries
http://library.link/vocab/relatedWorkOrContributorName
Erwin, Richard Scott.
Series statement
Springer Optimization and Its Applications,
Series volume
106
http://library.link/vocab/subjectName
  • Mathematical optimization
  • Economic theory
  • Computer science
  • Algorithms
  • Mathematics
  • Calculus of Variations and Optimal Control; Optimization
  • Economic Theory/Quantitative Economics/Mathematical Methods
  • Math Applications in Computer Science
  • Algorithms
  • Game Theory, Economics, Social and Behav. Sciences
  • Mathematical Applications in Computer Science
Label
An Introduction to Optimal Satellite Range Scheduling, by Antonio Jose Vazquez Alvarez, Richard Scott Erwin, (electronic resource)
Instantiates
Publication
Note
Description based upon print version of record
Bibliography note
Includes bibliographical references at the end of each chapters and index
Carrier category
online resource
Carrier category code
cr
Content category
text
Content type code
txt
Contents
  • Preface; Acknowledgments; Contents; Acronyms; Symbols; List of Figures; List of Tables; Part I Introduction; 1 Motivation; 1.1 Motivation; 1.2 Why Optimal Scheduling?; 1.3 Why this Book?; 1.4 Structure of the Book; 1.5 Main Contributions; References; 2 Scheduling Process; 2.1 Scheduling Process; 2.2 Scheduler Characteristics; 2.3 Satellite Range Scheduling Problems; 2.4 Issues Beyond the Scope of this Text; References; Part II Satellite Range Scheduling; 3 The Satellite Range Scheduling Problem; 3.1 Problem Formulation; 3.1.1 Model for the Scenario; 3.1.2 Model for the Requests
  • 3.1.3 Problem Constraints3.1.3.1 Preemption; 3.1.3.2 Number of Entities; 3.1.3.3 Duration of the Requests; 3.1.3.4 Redundancy; 3.1.3.5 Precedence; 3.1.3.6 Priority; 3.1.4 Schedule Metrics; 3.2 Complexity of SRS; 3.2.1 Introduction to Complexity Theory; 3.2.2 Complexity of the SRS Problem; 3.3 General Scheduling Problems; 3.3.1 Problem Classification; 3.3.2 Problem Reducibility; 3.4 Relating Satellite and General Scheduling Problems; 3.4.1 One Machine Problems; 3.4.1.1 1 rj,pij Uj; 3.4.1.2 1 rj,pij, prec Uj; 3.4.1.3 1 rj,pij wj Uj; 3.4.1.4 1 rj wj Uj; 3.4.1.5 1 rj,pij pij pij wj Uj
  • 3.4.2 Several Identical Machines Problems3.4.2.1 P rj,pij,CΣ Uj; 3.4.3 Several Unrelated Machines Problems; 3.4.3.1 R rj, pij,CΣ wj Uj; 3.4.3.2 R rj, pij,Cx wj Uj; 3.4.3.3 R rj, pij,CΣ, prec wj Uj; 3.4.3.4 R rj, CΣ wj Uj; 3.4.3.5 R rj, CΣ, prec wj Uj; 3.4.3.6 R rj,pij pij pij,CΣ wj Uj; 3.5 Summary; References; 4 Optimal Satellite Range Scheduling; 4.1 Scenario Model for Fixed Interval SRS; 4.2 Optimal Solution for Fixed Interval SRS; 4.2.1 Description of the Algorithm; 4.2.1.1 Event Generation; 4.2.1.2 Graph Creation; 4.2.1.3 Longest Path Calculation
  • 4.2.2 Optimality of the Solution and Complexityof the Algorithm4.3 Extension of the Algorithm; 4.3.1 Optimal Discretized Variable Slack SRS; 4.3.2 Optimal Fixed Interval SRS with Redundancy; 4.4 Remarks on the Complexity; 4.4.1 Greedy Earliest Deadline Algorithm; 4.4.2 Greedy Maximum Priority Algorithm; 4.4.3 About the Topology of the Scenario; 4.4.4 About the Number of Passes; 4.4.5 About Partial Results; 4.5 Graph Generation Example; Event Generation; Stage Z0; Stage Z1; Stage Z2; Stage Z3; Stage Z4; Rest of Stages; 4.6 Simulations; 4.6.1 Simulation: Practical Case
  • 4.6.2 Simulation: Worst Case4.6.3 Simulation: Number of Passes; 4.6.4 Simulation: Partial Results; 4.7 Summary; References; Part III Variants of Satellite Range Scheduling; 5 Noncooperative Satellite Range Scheduling; 5.1 Scenario Model for the SRS Game; 5.2 Elements of the SRS Game; 5.2.1 Players; 5.2.2 Sequential Decisions; 5.2.3 Actions; 5.2.4 Shared Information; 5.2.5 Payoffs; 5.2.6 Rationality; 5.2.7 Extensive Form; 5.3 SRS Game with Perfect Information; 5.3.1 Description of the Algorithm; 5.3.1.1 Event Generation; 5.3.1.2 Graph Elements; 5.3.1.3 Graph Creation
  • 5.3.2 Stackelberg Equilibrium Solution
Dimensions
unknown
Edition
1st ed. 2015.
Extent
1 online resource (180 p.)
Form of item
online
Isbn
9783319254098
Media category
computer
Media type code
c
Other control number
10.1007/978-3-319-25409-8
Specific material designation
remote
System control number
  • (CKB)3710000000532709
  • (EBL)4189369
  • (SSID)ssj0001597299
  • (PQKBManifestationID)16297179
  • (PQKBTitleCode)TC0001597299
  • (PQKBWorkID)14885683
  • (PQKB)10768015
  • (DE-He213)978-3-319-25409-8
  • (MiAaPQ)EBC4189369
  • (EXLCZ)993710000000532709
Label
An Introduction to Optimal Satellite Range Scheduling, by Antonio Jose Vazquez Alvarez, Richard Scott Erwin, (electronic resource)
Publication
Note
Description based upon print version of record
Bibliography note
Includes bibliographical references at the end of each chapters and index
Carrier category
online resource
Carrier category code
cr
Content category
text
Content type code
txt
Contents
  • Preface; Acknowledgments; Contents; Acronyms; Symbols; List of Figures; List of Tables; Part I Introduction; 1 Motivation; 1.1 Motivation; 1.2 Why Optimal Scheduling?; 1.3 Why this Book?; 1.4 Structure of the Book; 1.5 Main Contributions; References; 2 Scheduling Process; 2.1 Scheduling Process; 2.2 Scheduler Characteristics; 2.3 Satellite Range Scheduling Problems; 2.4 Issues Beyond the Scope of this Text; References; Part II Satellite Range Scheduling; 3 The Satellite Range Scheduling Problem; 3.1 Problem Formulation; 3.1.1 Model for the Scenario; 3.1.2 Model for the Requests
  • 3.1.3 Problem Constraints3.1.3.1 Preemption; 3.1.3.2 Number of Entities; 3.1.3.3 Duration of the Requests; 3.1.3.4 Redundancy; 3.1.3.5 Precedence; 3.1.3.6 Priority; 3.1.4 Schedule Metrics; 3.2 Complexity of SRS; 3.2.1 Introduction to Complexity Theory; 3.2.2 Complexity of the SRS Problem; 3.3 General Scheduling Problems; 3.3.1 Problem Classification; 3.3.2 Problem Reducibility; 3.4 Relating Satellite and General Scheduling Problems; 3.4.1 One Machine Problems; 3.4.1.1 1 rj,pij Uj; 3.4.1.2 1 rj,pij, prec Uj; 3.4.1.3 1 rj,pij wj Uj; 3.4.1.4 1 rj wj Uj; 3.4.1.5 1 rj,pij pij pij wj Uj
  • 3.4.2 Several Identical Machines Problems3.4.2.1 P rj,pij,CΣ Uj; 3.4.3 Several Unrelated Machines Problems; 3.4.3.1 R rj, pij,CΣ wj Uj; 3.4.3.2 R rj, pij,Cx wj Uj; 3.4.3.3 R rj, pij,CΣ, prec wj Uj; 3.4.3.4 R rj, CΣ wj Uj; 3.4.3.5 R rj, CΣ, prec wj Uj; 3.4.3.6 R rj,pij pij pij,CΣ wj Uj; 3.5 Summary; References; 4 Optimal Satellite Range Scheduling; 4.1 Scenario Model for Fixed Interval SRS; 4.2 Optimal Solution for Fixed Interval SRS; 4.2.1 Description of the Algorithm; 4.2.1.1 Event Generation; 4.2.1.2 Graph Creation; 4.2.1.3 Longest Path Calculation
  • 4.2.2 Optimality of the Solution and Complexityof the Algorithm4.3 Extension of the Algorithm; 4.3.1 Optimal Discretized Variable Slack SRS; 4.3.2 Optimal Fixed Interval SRS with Redundancy; 4.4 Remarks on the Complexity; 4.4.1 Greedy Earliest Deadline Algorithm; 4.4.2 Greedy Maximum Priority Algorithm; 4.4.3 About the Topology of the Scenario; 4.4.4 About the Number of Passes; 4.4.5 About Partial Results; 4.5 Graph Generation Example; Event Generation; Stage Z0; Stage Z1; Stage Z2; Stage Z3; Stage Z4; Rest of Stages; 4.6 Simulations; 4.6.1 Simulation: Practical Case
  • 4.6.2 Simulation: Worst Case4.6.3 Simulation: Number of Passes; 4.6.4 Simulation: Partial Results; 4.7 Summary; References; Part III Variants of Satellite Range Scheduling; 5 Noncooperative Satellite Range Scheduling; 5.1 Scenario Model for the SRS Game; 5.2 Elements of the SRS Game; 5.2.1 Players; 5.2.2 Sequential Decisions; 5.2.3 Actions; 5.2.4 Shared Information; 5.2.5 Payoffs; 5.2.6 Rationality; 5.2.7 Extensive Form; 5.3 SRS Game with Perfect Information; 5.3.1 Description of the Algorithm; 5.3.1.1 Event Generation; 5.3.1.2 Graph Elements; 5.3.1.3 Graph Creation
  • 5.3.2 Stackelberg Equilibrium Solution
Dimensions
unknown
Edition
1st ed. 2015.
Extent
1 online resource (180 p.)
Form of item
online
Isbn
9783319254098
Media category
computer
Media type code
c
Other control number
10.1007/978-3-319-25409-8
Specific material designation
remote
System control number
  • (CKB)3710000000532709
  • (EBL)4189369
  • (SSID)ssj0001597299
  • (PQKBManifestationID)16297179
  • (PQKBTitleCode)TC0001597299
  • (PQKBWorkID)14885683
  • (PQKB)10768015
  • (DE-He213)978-3-319-25409-8
  • (MiAaPQ)EBC4189369
  • (EXLCZ)993710000000532709

Library Locations

  • Architecture LibraryBorrow it
    Gould Hall 830 Van Vleet Oval Rm. 105, Norman, OK, 73019, US
    35.205706 -97.445050
  • Bizzell Memorial LibraryBorrow it
    401 W. Brooks St., Norman, OK, 73019, US
    35.207487 -97.447906
  • Boorstin CollectionBorrow it
    401 W. Brooks St., Norman, OK, 73019, US
    35.207487 -97.447906
  • Chinese Literature Translation ArchiveBorrow it
    401 W. Brooks St., RM 414, Norman, OK, 73019, US
    35.207487 -97.447906
  • Engineering LibraryBorrow it
    Felgar Hall 865 Asp Avenue, Rm. 222, Norman, OK, 73019, US
    35.205706 -97.445050
  • Fine Arts LibraryBorrow it
    Catlett Music Center 500 West Boyd Street, Rm. 20, Norman, OK, 73019, US
    35.210371 -97.448244
  • Harry W. Bass Business History CollectionBorrow it
    401 W. Brooks St., Rm. 521NW, Norman, OK, 73019, US
    35.207487 -97.447906
  • History of Science CollectionsBorrow it
    401 W. Brooks St., Rm. 521NW, Norman, OK, 73019, US
    35.207487 -97.447906
  • John and Mary Nichols Rare Books and Special CollectionsBorrow it
    401 W. Brooks St., Rm. 509NW, Norman, OK, 73019, US
    35.207487 -97.447906
  • Library Service CenterBorrow it
    2601 Technology Place, Norman, OK, 73019, US
    35.185561 -97.398361
  • Price College Digital LibraryBorrow it
    Adams Hall 102 307 West Brooks St., Norman, OK, 73019, US
    35.210371 -97.448244
  • Western History CollectionsBorrow it
    Monnet Hall 630 Parrington Oval, Rm. 300, Norman, OK, 73019, US
    35.209584 -97.445414
Processing Feedback ...