Abstract
In job shop simulation studies the effects of local priority dispatching rules have been studied extensively. Among these, due-date oriented priority rules (such as slack, slack/remaining operation, critical ratio) have been found to be effective and useful in practice. These priority dispatching rules are dynamic in nature, that is, the state of the priority entity changes continuously over time. Therefore, one should theoretically update the priorities of jobs waiting in a queue every time a machine at a work center becomes available. This is an extremely costly procedure even in experimental simulation studies.
Some researchers have tried a static version of these rules: the priority is calculated only when an operation arrives at a work center and joins the queue.
In this paper we study a slightly more dynamic version of this rule: in addition to calculating the priority when an operations arrives at a work center, update all job priorities at constant time intervals.
A comparative study between these two versions of handling a dynamic priority rule is presented utilizing three different due date assignment procedures used in practice.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Adam, N. and Surkis, J., ‘A Comparison of Capacity Planning Techniques in a Job Shop Control System’, Management Science, vol. 23, no. 5 (January 1977).
Baker, C. T. and Dzielinski, B. P., ‘Simulation of Simplified Job Shop’, Management Science, vol. 6, no. 3 (April 1960), pp. 311–323.
Berry, W. L. and Rao, V., ‘Critical Ratio Scheduling: An Experimental Analysis’, Management Science, vol. 22, no. 2 (October 1975), pp. 192–201.
Bulkin, M. H., Colley, J. L., and Steinhoff, H. W., ‘Load Forecasting, Priority Sequencing, and Simulation in a Job-Shop Control System’, Management Science, vol. 13, no. 2 (October 1966), pp. 29–51.
Carroll, D. C., ‘Heuristic Sequencing of Single and Multiple Component Jobs’, Ph.D. Dissertation Sloan School of Management, MIT (1965).
Conway, R. W., Johnson, B. M., and Maxwell, W. L., ‘An Experimental Investigation of Priority Dispatching’, Journal of Industrial Engineering, vol. XI, no. 3 (May-June 1960 ), pp. 221–229.
Conway, R. W., Maxwell, W. L., and Miller, L. W., Theory of Scheduling, Addison Wesley Publishing Co. (1967).
Eiion, S. and Hodgson, R. M., ‘Job Shop Scheduling with Due-Dates’, The International Journal of Production Research, vol. 6, no. 1 (1967), pp. 1–13.
Elvers, D. A., ‘A Simulation of Job Dispatching Rules Using Various Delivery Date Criteria’, Proceedings of the Fourth Annual Meeting of the American Institute for Decision Sciences (1972), pp. 479–486.
Gere, W. S., Jr., ‘Heuristics in Job Shop Scheduling’, Management Science, vol. 13, no. 3 (November 1966), pp. 167–190.
Holstein, William K., ‘Production Planning and Control Integrated’, Harvard Business Review (May-June 1968), pp. 121–140.
LeGrande, Earl, ‘The Development of a Factory Simulation System Using Actual Operating Data’, Management Technology, vol. III, no. 1 (May 1963).
Nanot, Y. R. ‘An Experimental Investigation and Comparative Evaluation of Priority Disciplines in Job Shop Like Queueing Networks’, Ph.D. Dissertation UCLA (1963).
Reiter, S., ‘A System for Managing Job-Shop Production’, The Journal of Business of the University of Chicago, vol. XXXIX (July 1966), pp. 371–393.
Rivera-Garza, M., ‘Labor and Machine Constrained Job Shops: A Simulation Investigation of Dispatching Rules’, Ph.D. Dissertation, Stanford University (1974).
Rowe, A. J., ‘Application of Computer Simulation to Sequential Decision Rules in Production Scheduling’, Proceedings Eleventh Annual Industrial Engineering Institute, University of California, Berkeley, Los Angeles (February 1959).
Surkis, J. and Adam, N., ‘Interaction of Priority Dispatching Rules and Due Date Assignment Procedures in Continuous Job Shops’, Proceedings of the Eighth Annual Meeting of the American Institute for Decision Sciences
Weeks, J. K. and Fryer, J. S., ‘A Simulation Study of Operating Policies in a Hypothetical Dual-Constrained Job Shop’, Management Science, vol. 22, no. 12 (August 1976), pp. 1362–1371.
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1979 Springer Science+Business Media Dordrecht
About this chapter
Cite this chapter
Surkis, J., Adam, N.R. (1979). Priority updating procedures in dynamic job shop simulation studies: the impact on measures of performance under different due date assignment rules. In: Ritzman, L.P., Krajewski, L.J., Berry, W.L., Goodman, S.H., Hardy, S.T., Vitt, L.D. (eds) Disaggregation. Springer, Dordrecht. https://doi.org/10.1007/978-94-015-7636-9_22
Download citation
DOI: https://doi.org/10.1007/978-94-015-7636-9_22
Publisher Name: Springer, Dordrecht
Print ISBN: 978-94-015-7638-3
Online ISBN: 978-94-015-7636-9
eBook Packages: Springer Book Archive