In this paper we describe a space application concerning the scheduling of command transmissions on a satellite constellation. The problem is modeled as a variant of the Parallel Multiprocessor Task Scheduling Problem. A computational experiment on a real data set compares an ILP formulation to a combinatorial branch-and-bound scheme.
Scheduling commands on a satellite constellation / Marinelli, Fabrizio; Nocella, S.; Rossi, F.; Smriglio, S.. - STAMPA. - (2003). (Intervento presentato al convegno MISTA2003, 1st Multidisciplinary International Scheduling Conference: Theory & Applications tenutosi a Nottingham, UK nel 13-16/08/2003).
Scheduling commands on a satellite constellation
MARINELLI, Fabrizio;
2003-01-01
Abstract
In this paper we describe a space application concerning the scheduling of command transmissions on a satellite constellation. The problem is modeled as a variant of the Parallel Multiprocessor Task Scheduling Problem. A computational experiment on a real data set compares an ILP formulation to a combinatorial branch-and-bound scheme.File in questo prodotto:
Non ci sono file associati a questo prodotto.
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
