Abstract
A dispatching rule is proposed for job shop operations where the performance criteria are due date related. The dispatching rule is constructed by combining the characteristics of the shortest process time rule and a dynamically determined earliest due date rule. The performance of the proposed rule is compared to currently well known rules across various shop environments using discrete simulation.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
K.R. Baker, Sequencing rules and due-date assignments in a job shop, Management Science 30 (1984) 1093.
K.R. Baker and J.J. Kanet, Job shop scheduling with modified due-dates, Journal of Operations Management 4 (1983) 11.
J.H. Blackstone, D.H. Phillips and G.L. Hogg, A state-of-art survey of dispatching rules for manufacturing job shop operations, International Journal of Production Research 20 (1982) 27.
D.C. Carroll, Heuristic sequencing of jobs with single and multiple components, Ph.D. Thesis, Sloan School of Management, Massachusetts Institute of Technology 1965.
R.W. Conway, Priority dispatching and work-in-process inventory in a job shop, The Journal of Industrial Engineering 24 (1965) 123.
R.W. Conway, W.L. Maxwell and L.W. Miller,Theory of Scheduling (Addison-Wesley Inc. Reading, Mass, 1967).
S. Eilon, I.G. Chowdhury and S.S. Serghioug, Experiments with SI rule in job shop scheduling, Simulation 24 (1975) 45.
S. Eilon and D.J. Cotterill, A modified SI rule in job shop sequenecing, International Journal of Production research 7 (1968) 135.
D.A. Elvers, Job shop dispatching using various due date setting criteria, Production and Inventory Management 14 (1973) 62.
D.A. Elvers, The sensitivity of the relative effectiveness of job shop dispatching rules with respect to various arrival distributions, AIIE Transactions 6 (1974) 41.
W.S. Gere, Heuristics in job shop scheduling, Management Science 13 (1966) 167.
Mark S. Fox, Job shop Scheduling: an investigation in constraint-directed reasoning, Ph.D. Thesis, Carnegie-Mellon University, 1983.
M.H. Han and L.F. McGinnis, Shop operating characteristic curve for shop control, Technical Report MHRC-TR-85-21, Material Handling Research Center, Georgia Institute of Technology, 1985.
E.H. Lehmann and H.J.M. D'abrera,Nonparametrics, Statistical Methods Based on Ranks Holden-Day, Inc., San Francisco, CA, (1975).
T.E. Morton and A.P.J. Vepsalainen, Leadtime estimation for priority scheduling with strategic tardiness costs, Working Paper, Graduate School of Industrial Administration, Carnegie-Mellon University, 1985.
M. Oral and J.L. Malouin, Evaluation of the shortest processing time scheduling rule with truncated process, AIIE Transactions 5 (1973) 357.
S.S. Panwalkar and W. Iskander, A survey of scheduling rules, Operations Research 25 (1977) 45.
R. Rochette and R.P. Sadowski, A statistical comparison of the performance of simple dispatching rules for a particular set of job shops, International Journal of Production Research 14 (1976) 63.
Author information
Authors and Affiliations
Additional information
This work was partially supported by: The National Science Foundation, Grant No. CDR-8300965; member companies of the Material Handling Research Center, the Georgia Institute of Technology and Texas A&M University.
Rights and permissions
About this article
Cite this article
Han, M.H., McGinnis, L.F. Due dates in a manufacturing shop: An unweighted case. Ann Oper Res 17, 217–232 (1989). https://doi.org/10.1007/BF02096606
Issue Date:
DOI: https://doi.org/10.1007/BF02096606