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.
Titolo: | Scheduling commands on a satellite constellation | |
Autori: | ||
Data di pubblicazione: | 2003 | |
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. | |
Handle: | http://hdl.handle.net/11566/49586 | |
Appare nelle tipologie: | 4.2 Abstract in Atti di convegno |
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.