scispace - formally typeset
Journal ArticleDOI

Network Dispatching by the Shortest-Operation Discipline

Richard W. Conway, +1 more
- 01 Feb 1962 - 
- Vol. 10, Iss: 1, pp 51-73
TLDR
The investigation involved the comparison of dispatching at random with dispatching in order of increasing processing time under different conditions of shop size, flow pattern, and level of work-in-process inventory.
Abstract
The significance of the dispatching function in production planning and control is discussed and applicable results in sequencing and queuing theory are reviewed. Experimental results for a network of queues representing a small job shop are presented. The investigation involved the comparison of dispatching at random with dispatching in order of increasing processing time under different conditions of shop size, flow pattern, and level of work-in-process inventory. Also considered is the effect of imperfect a priori knowledge of processing times upon the shortest-operation discipline Several modifications of the shortest-operation discipline were also tested one in which the shortest-operation discipline is 'truncated' and another in which it is periodically alternated with a first-come-first-served discipline.

read more

Citations
More filters
Journal ArticleDOI

A Survey of Scheduling Rules

TL;DR: A summary of over 100 priority dispatching rules, a list of many references that analyze them, and a classification scheme are presented in this article, along with a classification of the rules.
Journal ArticleDOI

A state-of-the-art survey of dispatching rules for manufacturing job shop operations.

TL;DR: A review of the state of the art in the study of dispatching rules can be found in this paper, where a dispatching rule is used to select the next job to be processed from a set of jobs awaiting service.
Journal ArticleDOI

A Survey of Priority Rule-Based Scheduling

TL;DR: A classification, a characterization, and an evaluation of elementary priority rules are presented, and some priority rule-related model extensions are discussed, which are used in Shop Floor Control software systems.
Journal ArticleDOI

Loading and control policies for a flexible manufacturing system

TL;DR: In this article, an experimental investigation of operating strategies for a computer-controlled flexible manufacturing system is reported, consisting of nine machines, an inspection station and a centralized queueing area, all interconnected by an automatic material handling mechanism.
Journal ArticleDOI

The Queue M/G/1 with the Shortest Remaining Processing Time Discipline

TL;DR: In this article, a priority queuing model in which the processing times of jobs are known upon arrival and preemption without loss of time or processing already accomplished is studied, where priority is assigned to jobs according to the length of processing remaining with highest priority going to the job with least processing left.
References
More filters
Journal ArticleDOI

A Proof for the Queuing Formula: L = λW

TL;DR: In this paper, it was shown that if the three means are finite and the corresponding stochastic processes strictly stationary, and if the arrival process is metrically transitive with nonzero mean, then L = λW.
Journal ArticleDOI

Networks of Waiting Lines

TL;DR: What is perhaps the simplest theoretical question related to this class of problems, and derives expressions for certain steady-state parameters for discrete, statistically varying flows through complex networks.
Journal ArticleDOI

Scheduling with Deadlines and Loss Functions

TL;DR: The problem of this paper is that of scheduling several one-stage tasks on several processors, which are capable of handling the tasks with varying degrees of efficiency, to minimize the total loss, which is a sum of losses associated with the individual tasks.