Authors
Laura Barbulescu, Jean-Paul Watson, L Darrell Whitley, Adele E Howe
Publication date
2004/1
Journal
Journal of Scheduling
Volume
7
Pages
7-34
Publisher
Kluwer Academic Publishers
Description
We present the first coupled formal and empirical analysis of the Satellite Range Scheduling application. We structure our study as a progression; we start by studying a simplified version of the problem in which only one resource is present. We show that the simplified version of the problem is equivalent to a well-known machine scheduling problem and use this result to prove that Satellite Range Scheduling is NP-complete. We also show that for the one-resource version of the problem, algorithms from the machine scheduling domain outperform a genetic algorithm previously identified as one of the best algorithms for Satellite Range Scheduling. Next, we investigate if these performance results generalize for the problem with multiple resources. We exploit two sources of data: actual request data from the U.S. Air Force Satellite Control Network (AFSCN) circa 1992 and data created by our problem …
Total citations
Scholar articles
L Barbulescu, JP Watson, LD Whitley, AE Howe - Journal of Scheduling, 2004