Integer and constraint programming for the offline nanosatellite partition scheduling problem

DOI10.1007/978-3-031-95976-9_11MaRDI QIDQ6897973zbMATH OpenFDO

Authors Julien Rouzot, Mickaël Pereira, Christian Artigues, Romain Boyer, Frédéric Camps, Philippe Garnier, Emmanuel Hebrard, Pierre Lopez

Publication date 19 November 2025

Full work available at URL https://doi.org/10.1007/978-3-031-95976-9_11

zbMATH Keywords

mixed integer linear programmingnanosatellites

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Mixed integer programming (90C11)

Cites work

• A branch-and-price algorithm for nanosatellite task scheduling to improve mission quality-of-service
• A continuous-time formulation for optimal task scheduling and quality-of-service assurance in nanosatellites
• A matheuristic approach to large-scale avionic scheduling
• Improving energy aware nanosatellite task scheduling by a branch-cut-and-price algorithm
• On a Bicriterion Formulation of the Problems of Integrated System Identification and System Optimization
• One-machine generalized precedence constrained scheduling problems
• Scheduling of time-triggered real-time systems

This page was built for publication: Integer and constraint programming for the offline nanosatellite partition scheduling problem

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