Showing papers on "Deadline-monotonic scheduling published in 1980"

Scheduling coupled tasks

Abstract: Consider a set of task pairs coupled in time: a first (initial) and second (completion) tasks of known durations with a specified time between them. If the operator or machine performing these tasks is able to process only one at a time, scheduling is necessary to insure that no overlap occurs. This problem has a particular application to production scheduling, transportation, and radar operations (send-receive pulses are ideal examples of time-linked tasks requiring scheduling). This article discusses several candidate techniques for schedule determination, and these are evaluated in a specific radar scheduling application.

Scheduling Independent Tasks with Due Times on a Uniform Processor System

Abstract: An algori thm to preemptively schedule n tasks on m uniform processors is presented. It is assumed that each task is available at t ime 0. Associated with each task is a due time by which it is to be completed. The algorithm schedules all tasks to complete by their due times whenever possible. The asymptotic time complexity of the algorithm is O(n log n + ran). It generates O(mn) preemptions in the worst case. An example of n tasks requiring O(mn) preemptions is also presented. The algorithm can also be used when all tasks have the same due times but different release times.

Priority Update Intervals and Anomalies in Dynamic Ratio Type Job Shop Scheduling Rules

Abstract: Dynamic priority dispatching rules in job shops require the computation of all job priorities in a work center queue every time a machine in the work center becomes idle. This is extremely costly. Alternative priority update procedures are studied and comparative results in terms of performance measures and costs are reported. Ease of implementation of the various procedures in a real world job shop environment is discussed. A second problem related to an anomaly in ratio type dynamic priority rules is also studied; a simple modification to remove the anomaly is suggested and the performances of the "old" and "modified" procedures are compared.

Optimal priority assignment in queues: application to marine congestion problems

Abstract: (1980). Optimal priority assignment in queues: application to marine congestion problems. Maritime Policy & Management: Vol. 7, No. 3, pp. 175-184.