Showing papers on "Deadline-monotonic scheduling published in 1979"
TL;DR: By using the “savings method” proposed by Clarke and Wright, and extended by Gaskell, each one of the above problems is defined as a series of assignment problems, and it is possible to obtain the optimal solution in a finite number of steps.
71 citations
TL;DR: This work examines the problem of scheduling parallel production lines in the glass-container industry with a resource constraint imposed by the furnace melting rate and concludes that a shortest processing time based dispatching rule probably provides the most efficient operating policy.
Abstract: By means of a computer simulation we examine the problem of scheduling parallel production lines in the glass-container industry with a resource constraint imposed by the furnace melting rate. The results of the simulation model are combined with relevant aspects of scheduling theory to arrive at the conclusion that a shortest processing time based dispatching rule probably provides the most efficient operating policy.
51 citations
TL;DR: The paper gives a practical, branch and bound based solution to the scheduling problem as found in real life, demonstrating that the usually accepted results from conventional simulation and other techniques using artificial jobsoperation time and technological route matrices are misleading.
Abstract: The paper gives a practical, branch and bound based solution to the scheduling problem as found in real life. Organizational aspects of solving the scheduling problem are considered, and two organizational ideas, ’ the area of responsibility ’ and ’ the time span of action ’, are presented. Intelligibility to administrators and operatives of the output from any scheduling system is emphasized, and the adoption of a wholly new concept, the ’ Generalized Ordered Schedule ’, is advocated as a means of achieving intuitive appeal and improved control. The requirements which any useful scheduling system must satisfy are identified, from field Btudies, and reported. Data are presented on a collection of real problems, and comparisons of decision rule solution procedures with the branch and bound procedure given. These demonstrate that the usually accepted results from conventional simulation and other techniques using artificial jobsoperation time and technological route matrices are misleading.
47 citations
35 citations
01 Nov 1979
TL;DR: The intent of this paper is to present a broad classification for various scheduling problems, to review important theoretical developments for these problem classes, and to contrast the currently available theory with practice of production scheduling.
Abstract: : Production scheduling may be defined as the allocation of available production resources over time to best satisfy some set of criteria. Typically, the scheduling problem involves a set of tasks to be performed, and the criteria involve tradeoffs between early and late completion of a task, and/or between holding inventory for the task and frequent production changeovers. The intent of this paper is to present a broad classification for various scheduling problems, to review important theoretical developments for these problem classes, and to contrast the currently available theory with practice of production scheduling. This paper will highlight problem areas both for which there is a significant discrepancy between practice and theory, and for which the practice corresponds closely to the theory.
4 citations
01 Jan 1979
TL;DR: In job shop simulation studies the effects of local priority dispatching rules have been studied extensively and due-date oriented priority rules (such as slack, slack/remaining operation, critical ratio) have been found to be effective and useful in practice.
Abstract: In job shop simulation studies the effects of local priority dispatching rules have been studied extensively. Among these, due-date oriented priority rules (such as slack, slack/remaining operation, critical ratio) have been found to be effective and useful in practice. These priority dispatching rules are dynamic in nature, that is, the state of the priority entity changes continuously over time. Therefore, one should theoretically update the priorities of jobs waiting in a queue every time a machine at a work center becomes available. This is an extremely costly procedure even in experimental simulation studies.
2 citations
1 citations