A branch-and-price algorithm for nanosatellite task scheduling to improve mission quality-of-service

DOI10.1016/J.EJOR.2022.02.040MaRDI QIDQ2673569zbMATH OpenOpenAlexWikidataFDO

Authors Cezar Antônio Rigo, Laio Oriel Seman, Edemar Morsch Filho, Eduardo Augusto Bezerra, Eduardo Camponogara, Pedro Munari

Publication date 10 June 2022

Published in European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ejor.2022.02.040

zbMATH Keywords

branch and priceDantzig-Wolfe decompositionnanosatellitequality of servicescheduling

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)

Recommendations

• A continuous-time formulation for optimal task scheduling and quality-of-service assurance in nanosatellites
• Optimization-based scheduling for the single-satellite, multi-ground station communication problem
• scientific article; zbMATH DE number 7155759
• A constraint-based approach to satellite scheduling
• Route-reduction-based dynamic programming for large-scale satellite range scheduling problem

Cites work

• A branch and price algorithm for EOS constellation imaging and downloading integrated scheduling problem
• A heuristic for the multi-satellite, multi-orbit and multi-user management of Earth observation satellites
• A mixed integer linear programming model for multi-satellite scheduling
• A multi-objective local search heuristic for scheduling Earth observations taken by an agile satellite
• An exact hybrid method for the vehicle routing problem with time windows and multiple deliverymen
• An interactive fuzzy programming system
• Branch-and-price: Column generation for solving huge integer programs
• Branching strategies in a branch-and-price approach for a multiple objective nurse scheduling problem
• Decomposition Principle for Linear Programs
• Enumeration and interactive selection of efficient paths in a multiple criteria graph for scheduling an earth observing satellite
• Fuzzy programming and linear programming with several objective functions
• scientific article; zbMATH DE number 5287068 (Why is no real title available?)
• scientific article; zbMATH DE number 3795684 (Why is no real title available?)
• Imaging-duration embedded dynamic scheduling of Earth observation satellites for emergent events
• JuMP: a modeling language for mathematical optimization
• New developments in the primal-dual column generation technique
• Primal Heuristics for Branch and Price: The Assets of Diving Methods
• Reformulation and decomposition of integer programs
• Selected Topics in Column Generation
• Using the primal-dual interior point algorithm within the branch-price-and-cut method

Cited in

(9)

• A continuous-time formulation for optimal task scheduling and quality-of-service assurance in nanosatellites
• Optimization-based scheduling for the single-satellite, multi-ground station communication problem
• Route-reduction-based dynamic programming for large-scale satellite range scheduling problem
• Improving energy aware nanosatellite task scheduling by a branch-cut-and-price algorithm
• Benders decomposition for the energy aware task scheduling of constellations of nanosatellites
• Scheduling of Earth observing satellites using distributed constraint optimization
• A branch-and-price algorithm for energy aware task scheduling of constellations of nanosatellites
• Nested branch-and-price for multi-mode nanosatellite task scheduling with interior-point regularization and GPU acceleration
• Integer and constraint programming for the offline nanosatellite partition scheduling problem

Describes a project that uses

Uses Software

• Gurobi
• JuMP

This page was built for publication: A branch-and-price algorithm for nanosatellite task scheduling to improve mission quality-of-service

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2673569)