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

Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment

Abstract: The problem of multiprogram scheduling on a single processor is studied from the viewpoint of the characteristics peculiar to the program functions that need guaranteed service. It is shown that an optimum fixed priority scheduler possesses an upper bound to processor utilization which may be as low as 70 percent for large task sets. It is also shown that full processor utilization can be achieved by dynamically assigning priorities on the basis of their current deadlines. A combination of these two scheduling techniques is also discussed.

Sequencing Research and the Industrial Scheduling Problem

Abstract: Types of industrial scheduling problems were investigated by personal visits to plants and by questionnaires mailed to scheduling departments. Information on problem sizes, job flow, optimization criteria and job similarity was obtained. Results indicate that most of the present procedures in theoretical research cannot handle average industrial problems. Also most commonly used objective criteria differ from industrial goals. There is a definite need for better communication between sequencing researchers and scheduling practioners.

An investigation of a cost-based rule for job-shop scheduling

Abstract: SUMMARY In this paper, a composite cost-oriented priority scheduling rule is compared to three other well-known rules, that are basically time-oriented. The criteria used for comparison include : total cost per job, number of late jobs, machine utilization, in-process inventory and the number of late jobs in-process. Repeated measures analysis of variance is used and followed by mean comparisons. Results suggest that SPT and cost rides are preferred in most of the criteria.

Scheduling independent tasks to reduce mean finishing-time (extended abstract)

Abstract: In this paper we study the problem of scheduling a set of independent tasks on m ≥ 1 processors to minimize the mean finishing-time (mean time in system). The importance of the mean finishing-time criterion is that its minimization tends to reduce the mean number of unfinished tasks in the system. In the paper we give a reduction of our scheduling problem to a transportation problem and thereby extend the class of known non enumerative scheduling algorithms [1]. Next we show that the inclusion of weights (weighted mean finishing-time) complicates the problem and speculate that there may be no non enumerative algorithm for this case. For the special case of identical processors we study the maximum finishing-time properties of schedules which are optimal with respect to mean finishing-time. Finally we give a scheduling algorithm having desirable properties with respect to both maximum finishing-time and mean finishing-time.