Aspects of Job Scheduling

Publisher Website
Google Scholar
Abstract
A mathematical model for job scheduling in a specified context is presented. The model uses both linear programming and combinatorial methods. While designed with a view toward optimization of scheduling of facility and plant operations at the Deep Space Network (DSN) Station at Goldstone, the context is sufficiently general to be widely applicable. The general scheduling problem including options for scheduling objectives is discussed and fundamental parameters identified. Mathematical algorithms for partitioning problems germaine to scheduling are presented. A more detailed description of algorithms and of operational aspects of the model is planned for a later report.

This publication has 0 references indexed in Scilit: