LEADER 07791nam 22008775 450 001 9910300249303321 005 20200705163319.0 010 $a3-319-25409-X 024 7 $a10.1007/978-3-319-25409-8 035 $a(CKB)3710000000532709 035 $a(EBL)4189369 035 $a(SSID)ssj0001597299 035 $a(PQKBManifestationID)16297179 035 $a(PQKBTitleCode)TC0001597299 035 $a(PQKBWorkID)14885683 035 $a(PQKB)10768015 035 $a(DE-He213)978-3-319-25409-8 035 $a(MiAaPQ)EBC4189369 035 $a(PPN)190885890 035 $a(EXLCZ)993710000000532709 100 $a20151211d2015 u| 0 101 0 $aeng 135 $aur|n|---||||| 181 $ctxt 182 $cc 183 $acr 200 13$aAn Introduction to Optimal Satellite Range Scheduling /$fby Antonio Jose Vazquez Alvarez, Richard Scott Erwin 205 $a1st ed. 2015. 210 1$aCham :$cSpringer International Publishing :$cImprint: Springer,$d2015. 215 $a1 online resource (180 p.) 225 1 $aSpringer Optimization and Its Applications,$x1931-6828 ;$v106 300 $aDescription based upon print version of record. 311 $a3-319-25407-3 320 $aIncludes bibliographical references at the end of each chapters and index. 327 $aPreface; 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 327 $a3.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 327 $a3.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 327 $a4.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 327 $a4.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 327 $a5.3.2 Stackelberg Equilibrium Solution 330 $aThe 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. 410 0$aSpringer Optimization and Its Applications,$x1931-6828 ;$v106 606 $aCalculus of variations 606 $aEconomic theory 606 $aComputer science?Mathematics 606 $aAlgorithms 606 $aGame theory 606 $aComputer mathematics 606 $aCalculus of Variations and Optimal Control; Optimization$3https://scigraph.springernature.com/ontologies/product-market-codes/M26016 606 $aEconomic Theory/Quantitative Economics/Mathematical Methods$3https://scigraph.springernature.com/ontologies/product-market-codes/W29000 606 $aMath Applications in Computer Science$3https://scigraph.springernature.com/ontologies/product-market-codes/I17044 606 $aAlgorithms$3https://scigraph.springernature.com/ontologies/product-market-codes/M14018 606 $aGame Theory, Economics, Social and Behav. Sciences$3https://scigraph.springernature.com/ontologies/product-market-codes/M13011 606 $aMathematical Applications in Computer Science$3https://scigraph.springernature.com/ontologies/product-market-codes/M13110 615 0$aCalculus of variations. 615 0$aEconomic theory. 615 0$aComputer science?Mathematics. 615 0$aAlgorithms. 615 0$aGame theory. 615 0$aComputer mathematics. 615 14$aCalculus of Variations and Optimal Control; Optimization. 615 24$aEconomic Theory/Quantitative Economics/Mathematical Methods. 615 24$aMath Applications in Computer Science. 615 24$aAlgorithms. 615 24$aGame Theory, Economics, Social and Behav. Sciences. 615 24$aMathematical Applications in Computer Science. 676 $a629.46 700 $aVazquez Alvarez$b Antonio Jose$4aut$4http://id.loc.gov/vocabulary/relators/aut$01062362 702 $aErwin$b Richard Scott$4aut$4http://id.loc.gov/vocabulary/relators/aut 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910300249303321 996 $aAn Introduction to Optimal Satellite Range Scheduling$92525161 997 $aUNINA