Skip to Main content Skip to Navigation

Theoretical and practical contributions to star observation scheduling problems

Abstract : Large telescopes are few and observing time is a precious resource subject to a strong pressure from a competitive community. Besides, a growing number of astronomical projects require surveying a large number of targets during discontinuous runs spread over few months or years. This thesis is the result of a collaboration between operations researchers from G-SCOP laboratory and astrophysicists from IPAG research unit. Its goal was to optimize the schedule of star observations on telescopes, in particular, on the Very Large Telescope. The first chapter contains a theoretical study of the complexity of several variants of processing time dependent profit maximization scheduling problems. Those problems appear inter alia as sub-problem of the real life star observation scheduling problem studied in the second chapter, for which we developed a fast and efficient Large Neighborhood Search algorithm. The third chapter is not related to the star observation scheduling problem. It describes the Tree Search based algorithm we developed for the glass cutting problem raised by the company Saint-Gobain for the ROADEF/EURO challenge 2018.
Document type :
Complete list of metadatas

Cited literature [55 references]  Display  Hide  Download
Contributor : Abes Star :  Contact
Submitted on : Wednesday, September 2, 2020 - 10:20:07 AM
Last modification on : Wednesday, October 14, 2020 - 4:19:18 AM


Version validated by the jury (STAR)


  • HAL Id : tel-02927933, version 1



Florian Fontan. Theoretical and practical contributions to star observation scheduling problems. General Mathematics [math.GM]. Université Grenoble Alpes, 2019. English. ⟨NNT : 2019GREAM046⟩. ⟨tel-02927933⟩



Record views


Files downloads