Accession Number:

AD0294126

Title:

ON A PSEUDO-SOLUTION TO A SCHEDULING PROBLEM

Descriptive Note:

Corporate Author:

STANFORD UNIV CALIF APPLIED MATHEMATICS AND STATISTICS LABS

Personal Author(s):

• ZACKS,S.

Report Date:

1962-12-14

Pagination or Media Count:

1.0

Abstract:

The scheduling problem considered is relatively simple. All the operations were considered as equally important, and it was assumed that each of the operations could be performed at any time uninterruptedly. In reality, most of the scheduling problems are more complicated. Some operations often require priority over other operations in the sense that they are more profit-ABLE OR A HIGHER UTILITY WEIGHT IS ATTACHED TO THEM. In these cases, the scheduling problem might be more complicated, since there are more restrictions in the case of priorities, and more freedom of choice in the case of discontinuous operations. Yet, no way of finding a general optimal solution, which is short of complete enumeration, was established. Pseudo-solutions, based on an extra assumption concerning the dependence structure among the earliest starting points of operations, were derived by the method of dynamic programming. Author

Descriptors:

• *OPERATIONS RESEARCH
• *SCHEDULING
• SEQUENCES(MATHEMATICS)
• SEQUENTIAL ANALYSIS
• SERIES(MATHEMATICS)
• TEST METHODS

Subject Categories:

Distribution Statement:

APPROVED FOR PUBLIC RELEASE