Abstract
Lagrange multipliers may be used to obtain a strong lower bound on the cost of an optimal solution for the resource-contrained network scheduling problem. A branch-and-bound algorithm designed to complement this procedure for obtaining bounds is presented here. We show how the concept of an active schedule may be used to eliminate nodes in the tree and how to update the multipliers when we branch.
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
E. Balas, “Machine Sequencing via Disjunctive Graphs: An Implicit Enumeration Algorithm.” Operations Research, XVII, No. 6, (November-December, 1969).
R. W. Conway, W. L. Maxwell, and L. W. Miller, Theory of Scheduling, Addison-Wesley, 19 67.
E. W. Davis and G. E. Heidorn, “An Algorithm for Optimal Project Scheduling Under Multiple Resource Constraints.” Management Science, XVII,(1971), 803 — 816.
M. L. Fisher, “Optimal Solution of Scheduling Problems Using Lagrange Multipliers: Part I.” Forthcoming in Operations Research.
M. L. Fisher, “Optimal Solution of Resource Constrained Network Scheduling Problems.” Technical Report No. 56, Operations Research Center, Massachusetts Institute of Technology, September, 1970.
M. L. Fisher and Jeremy F. Shapiro, “Constructive Duality in Integer Programming.” Report 7224-, Center for Mathematical Studies in Business and Economics, University of Chicago, May, 1972.
B. Giffler and G. L. Thompson, “Algorithms for Solving Production Scheduling Problems.” Operations Research, VIII, (1960), 487–503.
M. Held and R. M. Karp, “The Traveling Salesman Problem and Minimum Spanning Trees.” Operations Research, XVIII, No. 6, (1970), 1138–1162.
M. Held and R. M. Karp, “The Traveling Salesman Problem and Minimum Spanning Trees: Part II.” Mathematical Programming, I, (1971), 6–25.
T. J. R. Johnson, “An Algorithm for the Resource Constrained Project Scheduling Problem.” Unpublished Ph.D. thesis, Sloan School of Management, MIT, (August, 1967).
J. F. Muth and G. L. Thompson, Industrial Scheduling, Englewood Cliffs, N. J.: Prentice-Hall, Inc., 1963.
G. T. Patton, “Optimal Scheduling of Resource Constrained Projects.” Ph.D. dissertation, Stanford University, August, 1968.
A. B. Pritsker, L. J. Watters, and P. M. Wolfe, “Multiproject Scheduling with Limited Resources: A Zero-One Programming Approach.” Management Science, XVI, (1969), 93–108.
L. E. Schrage, “Solving Resource-Constrained Network Problems by-Implicit Enumeration--Nonpreemptive Case.” Operations Research, XVIII, No. 2 (March-April, 1970), 273–278.
L. E. Schrage, “Obtaining Optimal Solutions to Resource Constrained Network Scheduling Problems.” Paper presented at the American Institute of Industrial Engineers Systems Engineering Conference, Phoenix, Arizona, February 11–13, 1971.
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
Fisher, M.L. (1973). Optimal Solution of Scheduling Problems Using Lagrange Multipliers: Part II. 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_20
Download citation
DOI: https://doi.org/10.1007/978-3-642-80784-8_20
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-06437-4
Online ISBN: 978-3-642-80784-8
eBook Packages: Springer Book Archive