A Lagrangian heuristic for satellite range scheduling with resource constraints

The data exchange between ground stations and satellite constellations is becoming a challenging task, as more and more communication requests must be daily scheduled on a few, expensive stations located all around the Earth. Most of the scheduling procedures adopted in practice cannot cope with suc...

Full description

Saved in:

Bibliographic Details
Published in:	Computers & operations research Vol. 38; no. 11; pp. 1572 - 1583
Main Authors:	Marinelli, Fabrizio, Nocella, Salvatore, Rossi, Fabrizio, Smriglio, Stefano
Format:	Journal Article
Language:	English
Published:	Kidlington Elsevier Ltd 01.11.2011 Elsevier Pergamon Press Inc
Subjects:	Applications Applied sciences Communication satellites Computer science; control theory; systems Computer systems and distributed systems. User interface Constellations Exact sciences and technology Ground stations Heuristic Integer programming Lagrange multiplier Lagrangian heuristic Linear programming Mathematical analysis Mathematical models Mathematical programming Multiprocessor scheduling Operational research and scientific management Operational research. Management science Optimization Satellite communications Satellites Scheduling Scheduling, sequencing Software Studies Time-indexed scheduling formulation Italy Multiprocessor scheduling Time-indexed scheduling formulation Lagrangian heuristic Applications Satellite communications Income Satellite telecommunication Temporal databases Satellite Time dependence Lagrange multiplier Zero one programming Independent set Relaxation method Large scale system Interval graph Script Lagrangian Task scheduling Graph theory Constrained optimization Integer programming Processor scheduling Resource constraint Optimal solution Heuristic method
ISSN:	0305-0548, 1873-765X, 0305-0548
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!