Abstract
The application of sequence scheduling rules at a manufacturing facility is discussed. Three sequencing rules are contrasted — minimum slack time per operation, minimum start date with compression, and critical ratio.
The large scale data processing production environment is discussed. When computer failures occur there is often need for a fast recovery procedure which has decision rules to reschedule network jobs and minimize the lateness of production job delivery commitments. The problem is structured as a resource-constrained project network problem with multiple subnetworks and multiple resource requirements. Some potential methods for rapid solution are suggested for investigation.
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.
Footnotes
Panwalkar, S. S. Dudek, R. A., and Smith, M. L., “Sequencing Research and the Industrial Scheduling Problem” (paper presented at Symposium on Theory of Scheduling and Its Applications, North Carolina State University, Raleigh, N. C., May 15–17, 1972), 3.
Bennington, G. E., and McGinnis, L. F., “A Critique of Project Planning Under Constrained Resources” (paper presented at Symposium on Theory of Scheduling and Its Applications, North Carolina State University, Raleigh, N. C., May 15–17, 1972), 1.
LeGrande, E., “The Development of a Factory Simulation System Using Actual Operating Data”, Management Technology III No. 1 (May 1963), 1.
Steinhoff, H. W., Jr., “Daily System for Sequencing Orders in a Large Scale Job Shop”, 6th Annual ORSA/TIMS Joint Western Regional Meeting, Orcas Island Washington, April, 1964. Also in Buffa, E. (ed.) Readings in Production and Operations Management, Wiley, 1966. 155–166.
Bulkin, G. H., Colley, J. L., and Steinhoff, H. W., Jr., “Load Forecasting, Priority Sequencing and Simulation in a Job Shop Control System”, Management Science XIII (October 1966), B-29 — B-51.1966
Putnam, A. O., Everdell, R., Dorman, G. H., Cronan, R. R., and Lindgren, L. H., “Updating Critical Ratio and Slack-Time Priority Scheduling Rules”, Production Inventory Management XII No. 4 (Fourth Quarter 1971), 51–73.
Ibid., pp. 64–65.
Davis, E. W., and Heidorn, G. E., “An Algorithm for Optimal Project Scheduling Under Multiple Resource Constraints”, Management Science XVII (April 1971), B-803 — B-8l6.
Ibid., p. B-803.
Fisher, M. L., “Optimal Solution of Scheduling Problems Using Lagrange Multipliers: Part II” (paper presented at Symposium on Theory of Scheduling and Its Applications, North Carolina State University, Raleigh, N. C., May 15–17, 1972), 2–3. The six conditions described by Fisher and his nomenclature have been adopted as a reference and then modified and expanded as necessary to describe the data processing scheduling problem.
Pritsker, A. Allen B., Watters, L. J., and Wolfe, P. M., “Multiproject Scheduling with Limited Resources: A Zero-One Programming Approach”, Management Science XVI (September 1969), 93–108.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1973 Springer-Verlag Berlin · Heidelberg
About this paper
Cite this paper
Steinhoff, H.W. (1973). Two Recent Developments in Scheduling Applications. In: Elmaghraby, S.E. (eds) Symposium on the Theory of Scheduling and Its Applications. Lecture Notes in Economics and Mathematical Systems, vol 86. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-80784-8_8
Download citation
DOI: https://doi.org/10.1007/978-3-642-80784-8_8
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-06437-4
Online ISBN: 978-3-642-80784-8
eBook Packages: Springer Book Archive