1977
DOI: 10.1287/opre.25.1.45
|View full text |Cite
|
Sign up to set email alerts
|

A Survey of Scheduling Rules

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.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
317
0
8

Year Published

1992
1992
2014
2014

Publication Types

Select...
5
3
2

Relationship

0
10

Authors

Journals

citations
Cited by 1,073 publications
(340 citation statements)
references
References 22 publications
0
317
0
8
Order By: Relevance
“…Dispatching rule [10] is convenient scheduling method that is widely used in industry. However, the major criticism of it is that there is no single universal rule, and the effectiveness of any rule depends on the scheduling criterion and the prevailing conditions in the job shop.…”
Section: Cost Oriented Iterative Scheduling Methodsmentioning
confidence: 99%
“…Dispatching rule [10] is convenient scheduling method that is widely used in industry. However, the major criticism of it is that there is no single universal rule, and the effectiveness of any rule depends on the scheduling criterion and the prevailing conditions in the job shop.…”
Section: Cost Oriented Iterative Scheduling Methodsmentioning
confidence: 99%
“…• EDD, Earliest Due Date (Panwalkar and Iskander, 1977). Select the job with the earliest due-date, that is, select the minimum ib Z , where:…”
Section: Appendix: Definition Of the Dispatching Rulesmentioning
confidence: 99%
“…The model assumes an operation earliest due date (see [15]). Stochastic distributions for interarrival time of customer orders and customer required lead times are assumed.…”
Section: Model Assumptionsmentioning
confidence: 99%