Recent developments in the design of job shop scheduling systems have inspired a new approach to priority dispatching. The basis for the approach is in elementary decision theory: at each decision juncture define the alternative courses of action, evaluate the consequences of each alternative according to a given criterion, and choose the best alternative. The experimental results of a simulated single machine queueing system reinforce earlier findings that a decision theory approach represents a significant advance over conventional priority dispatching.
AndersonE. J. and NyirendaJ. C. (1990), “Two New Rules to Minimize Tardiness in a Job Shop,”International Journal of Production Research, 28, 12, 2277–2292.
2.
BakerK. R. (1974), Introduction to Sequencing and Scheduling, John Wiley & Sons, New York.
3.
BakerK. R. (1984), “Sequencing Rules and Due‐Date Assignments in a Job Shop,”Management Science, 30, 9, 1093–1104.
4.
BakerK. R. and BertrandJ. W. M. (1982), “A Dynamic Priority Rule for Sequencing Against Due‐Dates,”Journal of Operations Management, 3, 1, 37–42.
5.
BakerK. R. and KanetJ. J. (1983), “Job Shop Scheduling with Modified Operation Due Dates,”Journal of Operations Management, 4, 1, 11–22.
6.
BuffaE. S. and TaubertH. (1972), Production‐Inventory Systems: Planning and Control, Richard D. Irwin, Inc., Homewood, IL.
7.
CarrollD. C. (1965), “Heuristic Sequencing of Jobs with Single and Multiple Components,” Ph.D. dissertation, Sloan School of Management, MIT.
8.
ChryssolourisG. (1992), Manufacturing Systems: Theory and Practice, Springer‐Verlag, New York.
9.
ChryssolourisG.PierceJ., and DickeK. (1991), “An Approach for Allocating Manufacturing Resources to Production Tasks,”Journal of Manufacturing Systems, 10, 5, 368–382.
10.
ChryssolourisG.WrightK.PierceJ., and CobbW. (1988), “Manufacturing Systems Operation: Dispatch Rules Versus Intelligent Control,”Robotics and Computer-Integrated Manufacturing, 4, 3/4, 531–544.
11.
DuJ., and LeungJ. Y.‐T. (1990), “Minimizing Total Tardiness on One Machine is NP‐Hard,”Mathematics of Operations Research, 15, 3, 483–495.
12.
FrenchS. (1982), Sequencing and Scheduling: An Introduction to the Mathematics of the Job‐Shop, Ellis Horwood Ltd., Chichester, England.
13.
GifflerB. and ThompsonG. L. (1960), “Algorithms for Solving Production‐Scheduling Problems,”Operations Research, 8, 4, 487–503.
KanetJ. J. (1981), “Designing Lead Times for MRP Inventory Management Systems,”Proceedings Academy of Management, San Diego, CA, pp. 327–331.
16.
KanetJ. J. (1986), “Tactically Delayed Versus Non‐Delay Scheduling: An Experimental Investigation,”European Journal of Operational Research, 24, 1, 99–105.
17.
KanetJ. J. and ChristyD. P. (1983), “A Comparison of Allowance Methods in Manufacturing Systems,”American Institute for Decision Sciences 1983 Conference Proceedings, San Antonio, TX, pp. 646–648.
18.
KanetJ. J. and HayyaJ. C. (1982), “Priority Dispatching with Operation Due Dates in a Job Shop,”Journal of Operations Management, 2, 4, 167–176.
19.
MortonT. E.LawrenceS. R.RajagopolanS., and KekreS. (1988), “SCHED‐STAR: A Priced‐Based Shop Scheduling Module,”Journal of Manufacturing and Operations Management, 1, 1, 131–181.
20.
MortonT. E. and SinghM. R. (1988), “Implicit Costs and Prices for Resources with Busy Periods,”Journal of Manufacturing and Operations Management, 1, 4, 305–322.
21.
OwP. S. and MortonT. E. (1989), “The Single Machine Early/Tardy Problem,”Management Science, 35, 2, 177–191.
22.
RachamaduguR. M. and MortonT. E. (1982), Myopic Heuristics for the Single Machine Weighted Tardiness Problem, Working Paper 30–82–83, Graduate School of Industrial Administration, Carnegie Mellon University, Pittsburgh, PA.
23.
Rinnooy KanA. H. G. (1976), Machine Scheduling Problems: Classification, Complexity and Computations, Martinus Nijhoff, The Hague, Holland.
24.
VepsalainenA. P. J. and MortonT. E. (1987), “Priority Rules for Job Shops with Weighted Tardiness Costs,”Management Science, 33, 8, 1035–1047.
