A Branch and Bound Algorithm for Agile Earth Observation Satellite Scheduling
The agile earth observing satellite scheduling (AEOSS) problem consists of scheduling a subset of images among a set of candidates that satisfy imperative constraints and maximize a gain function. In this paper, we consider a new AEOSS model which integrates a time-dependent temporal constraint. To...
Gardado en:
| Principais autores: | , , |
|---|---|
| Formato: | Artigo |
| Idioma: | Inglês |
| Publicado: |
Wiley
2017-01-01
|
| Series: | Discrete Dynamics in Nature and Society |
| Acceso en liña: | http://dx.doi.org/10.1155/2017/7345941 |
| Tags: |
Sen Etiquetas, Sexa o primeiro en etiquetar este rexistro!
|