Abstract
In this paper the machine loading problem, i.e. the problem of the optimal assignment of n jobs to m machines of limited capacities, is considered with the further constraint that each job has to be performed using one machine only. The problem may be formulated as an integer 0,1 LP problem, for which an implicit enumeration method of solution is suggested. This method draws advantage from: i) a proposed heuristic solution, to have a good initial “ceiling” (often the optimal solution itself!), ii) an “a priori” criterium to widely reduce the set of solutions to be inspected, iii) a special method to get bounding functions and branching criteria. A wide computational experience allows a good insight into the method.
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Bibliography
E. Balas, “An Additive Algorithm for Solving Linear Programs with Zero-One Variables”, Opns. Res. 13, 517–546 (1965).
E. Balas, “Discrete Programming by the Filter Method”, Opns. Res. 15, 915–957 (1967).
A. De Maio and C. Roveda, “An All Zero-One Algorithm for a Certain Class of Transportation Problems”, Opns.Res. 19, 1406–1418 (1971).
G.T. Ross and R.M. Soland, “A Branch and Bound Algorithm for the Generalized Assignment Problem”, Research Report n.CS138, Center for Cybernetic Studies, The University of Texas,Sept. 1973.
A.H. Land and A.G. Doig, “An Automatic Method of Solving Discrete Programming Problems”, Econometrica 28,497–520 (1960).
V. Srinivasan and G. Thompson, “An Algorithm for Assigning Uses to Sources in a Special Class of Transportation Problems”, Opns. Res. 21, 284–295 (1973).
A.M. Geoffrion and R.E. Marsten, “Integer Programming Algorithms: a Framework and State-of-Art Survey”, Management Sci. 18, 465–491 (1972).
C. Sandi, “Heuristic Solution to the Transportation Problem with Binary Variables”, Technical Report n.513–3528, IBM Italy Pisa Scientific Center, July, 1974.
C. Sandi, “Reduction in the Search Solving a Certain Class of 0,1 IP Problems by Enumerative Methods”, Technical Report n.513–3511, IBM Italy Pisa Scientific Center, June 1972.
N.P. Tuan, “A Flexible Tree-Search Method for Integer Programming Problems”, Opns. Res.19, 115–119 (1971).
C. Sandi, “Transportation Problem Solved by a Sequence of Shortest-Path Problems”, Technical Report n.513–3529, IBM Italy Pisa Scientific Center, June 1974.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1995 D. Reidel Publishing Company, Dordrecht-Holland
About this paper
Cite this paper
Sandi, C. (1995). Solution of the Machine Loading Problem with Binary Variables. In: Roy, B. (eds) Combinatorial Programming: Methods and Applications. NATO Advanced Study Institutes Series, vol 19. Springer, Dordrecht. https://doi.org/10.1007/978-94-011-7557-9_22
Download citation
DOI: https://doi.org/10.1007/978-94-011-7557-9_22
Publisher Name: Springer, Dordrecht
Print ISBN: 978-94-011-7559-3
Online ISBN: 978-94-011-7557-9
eBook Packages: Springer Book Archive