A Survey of Scheduling Rules
Operations ResearchPublished 1 February 1977
S. S. Panwalkar, Wafik H. Iskander
Citations1,295
SJR quartileQ1
SJR score2.56
SNIP1.83
Generate an AI Snapshot to get a quick, structured summary of this paper.
Study Snapshot
ObjectiveStudy objective
MethodsResearch methodology
PopulationPopulation studied
Sample sizeSample sizes
OutcomesStudy outcomes here
ResultsStudy results comes here
LimitationsResearch study limitations comes here
A concise AI-generated summary of the paper will appear here once you click Generate AI Snapshot.
TL;DR
This paper presents a summary of over 100 priority dispatching rules, a list of many references that analyze them, and a classification scheme.
Abstract
In the past two decades researchers in the field of sequencing and scheduling have analyzed several priority dispatching rules through simulation techniques. This paper presents a summary of over 100 such rules, a list of many references that analyze them, and a classification scheme.
Keywords
Engineering
Management ScienceHeuristics in Job Shop Scheduling
226 Citations1966William S. Gere
The approach is simulative in that the operation of the shop is simulated in a Fortran program, but in addition to the straightforward use of priority rules for determining sequences of jobs on the machines, a number of heuristics or rules of thumb are incorporated.
Management ScienceSimulation of a Simplified Job Shop
116 Citations1960Christopher Baker, B. P. Dzielinski
This is a report of the results of some digital computer simulation studies of a simplified model of a job shop production process that found the average manufacturing times and predictability of completion times were used as measures of effectiveness.
Operations ResearchNetwork Dispatching by the Shortest-Operation Discipline
101 Citations1962R. W. Conway, William Maxwell
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.
Management ScienceThe Influence of Setup Time on Job Shop Performance
98 Citations1969Jon K. Wilbrecht, William B. Prescott
The study indicates that, for a fully loaded shop, giving priority to be the job with the shortest actual setup time, regardless of its run time, gives the best overall performance result.
Management ScienceThree Heuristic Rules for Sequencing Jobs to a Single Production Facility
84 Citations1965J. William Gavett
The study consists of examining the performance of the three heuristic rules in terms of the optimal downtime obtained by the branch and bound algorithm and the downtime which results from a random sequencing of jobs through the facility.
Management ScienceOperating Policies in Multiechelon Dual-Constraint Job Shops
79 Citations1973John S. Fryer
International Journal of Production ResearchJOB SHOPS SCHEDULING WITH DUE DATES
70 Citations1967Samuel Eilon, Robert Hodgson
A simulation model is developed for a jobbing shop, which consists of two identical machines operating in parallel, to compare five loading rules for several rates of arrivals and suggest how more realistic due dates can be quoted.
Management ScienceLabor Flexibility in Multiechelon Dual-Constraint Job Shops
69 Citations1974John S. Frye
International Journal of Production ResearchA MODIFIED SI RULE IN JOB SHOP SCHEDULING
60 Citations1968Samuel Eilon, D. J. COTTERJLL
The study described in this paper involved a simulation of a hypothetical shop with several machines and a number of alternative rules and variations on the SI rule were investigated.
Management ScienceJob Shop Scheduling with Due Dates and Variable Processing Times
60 Citations1974Charles A. Holloway, Rosser T. Nelson
A multi-pass heuristic scheduling procedure developed for job scheduling problems with deterministic processing times is tested with processing times that are random variables and the delay schedule produced by the heuristic procedure was found to be markedly superior under certain conditions.
Management ScienceLoad Forecasting, Priority Sequencing, and Simulation in a Job Shop Control System
55 Citations1966Michael H. Bulkin, John L. Colley +1 more
A simulation which sequences shop operations for the next shift is reported, which illustrates the practicality and desirability of incorporating advanced concepts into operating systems if the system's demands on working personnel are made compatible with the objectives and capabilities of the workers.
RAND Corporation eBooksAn Experimental Investigation of Priority Assignment in a Job Shop
52 Citations1964Richard W. Conway
Operations ResearchMethods of Sequencing in Job Shops—A Review
41 Citations1959Roger L. Sisson
The definition of the job shop is reviewed, the models proposed to date, solutions based on these models, and prospects for the future are surveyed.
International Journal of Production ResearchAn investigation of a cost-based rule for job-shop scheduling
23 Citations1973Sumer C. Aggarwal, F. Paul Wyman +1 more
A composite cost-oriented priority scheduling rule is compared to three other well-known rules, that are basically time-oriented, that suggest that SPT and cost rides are preferred in most of the criteria.
Journal of the Operational Research SocietyA Simulation Study of Sequencing in Batch Production
22 Citations1968R. H. Hollier
A simulation experiment is described involving the sequencing of jobs through a hypothetical batch production shop under conditions of variable shop load and route configurations for the jobs.
Management ScienceThe Effectiveness of Three Heuristic Rules for Job Sequencing in a Single Production Facility
16 Citations1973Ronald D. Haynes, C. A. Komar +1 more
It is indicated that job conditions do affect the effectiveness of these three heuristic rules used in production sequencing, where the objective is to minimize the downtime due to setup changes.
International Journal of Production ResearchEXPERIMENTS WITH PRIORITY DISPATCHING RULES IN A PARALLEL PROCESSOR SHOP
15 Citations1967Colin L. Moodie, Stephen D. Roberts
In general, the performance of the shop was substantially improved by using the priority rules, and some interesting differences were observed.
Naval Research Logistics QuarterlySimulations to explore alternative sequencing rules
13 Citations1968Robert G. Brown
A flexible simulation system has been designed to permit investigation of sequencing rules in a large job shop, with continual input of new work, to understand what happens rather than to find optimum rules.
A I I E TransactionsSequencing n Products Involving<i>m</i>Independent Jobs on m Machines
8 Citations1971A. Alan B. Pritsker, Louis W. Miller +1 more
It is shown that there exists an optimal schedule with the “no passing property” and branch and bound routines are developed for finding the optimal solution for the two measures of performance: total penalty cost and sum of product completion times.