Aspects of Job Scheduling

[+] Author and Article Information
K. Phillips

Dept. of Mathematics, New Mexico State University, Las Cruces, N. M. 88003

J. Eng. Ind 101(1), 17-22 (Feb 01, 1979) (6 pages) doi:10.1115/1.3439468 History: Received April 06, 1978; Online July 15, 2010


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.

Copyright © 1979 by ASME
Your Session has timed out. Please sign back in to continue.





Some tools below are only available to our subscribers or users with an online account.

Related Content

Customize your page view by dragging and repositioning the boxes below.

Related Journal Articles
Related eBook Content
Topic Collections

Sorry! You do not have access to this content. For assistance or to subscribe, please contact us:

  • TELEPHONE: 1-800-843-2763 (Toll-free in the USA)
  • EMAIL: asmedigitalcollection@asme.org
Sign In