| Summary: | 碩士 === 國立新竹教育大學 === 人資處數學教育碩士班 === 97 === ABSTRACT
The study of satellite imaging scheduling has always focused on single-machine imaging. Because of the close interchange between countries, however, the multi-machine imaging scheduling which employs satellites of different countries to image in specific spots to make the process more effective and efficient would become one of the research topics in the future. This project studies two imaging satellites of the same performance working on parallel machine imaging in Earth orbit. Besides, the process of single machine imaging on the same spot for two times continually could be regarded as a parallel machine scheduling.
Basing on the premise of not switching camera lens and continuous imaging, this project has developed an optimal solution algorithm to the use of two parallel machines imaging scheduling, which is called “sort-matching algorithm”. Firstly, arrange the total number of the target jobs in the imaging zone of each machine in a descending order. Next, work on the matching and counting the combination numbers to obtain the optimal solution by excluding non-optimal solution matches with a judgment to speed up the algorithm. Finally, use computers to simulate the process to testify that this kind of algorithm reduces more process times in solution than the method of exhaustion does in imaging scheduling.
Although there are several experimental control variables in this satellite imaging scheduling, which may not totally apply to the need of real imaging process, this model could still be developed into a more beneficial satellite scheduling one.
|
|---|
