Abstract
There are three kinds of papers connected with the branch and bound method (B&B). The very general ones (artifical intelligence level), the papers presenting algorithms for fixed problems and the papers considering the method applied to some class of problems (e.g. the discrete programming. The papers dealing with B&B applied to optimization of control of discrete manufacturing processes are usually of the second kind. This paper is aimed at generalization and formal discussion of given there algorithms, thus it belongs to the last group. It uses the mathematical model of the vast class of discrete manufacturing processes, proposed in the earlier author’s papers. Basing on the introduced there formalism, a new classification of fundamental conception of algorithms is presented, different types of lower bounds are defined and domination rules for lower bounds are determinated. The paper refers to algorithms that do not use the discrete programming model.
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
Dudek-Dyduch E.: Scheduling some class of discrete processes, Proc. of 12th IMACS World Congress, Paryz 1988.
Grabowski J.: A new formulation and solution of the sequencing problem: mathematical model, Zastosowania Matematyki Nr 15, 1976, 325–343.
Grabowski J.: A new formulation and solution of the sequencing problem: algorithm, Zastosowania Matematyki Nr 15, 1977, 463–474.
Syslo M.M., Deo N., Kowalik J.S.: Discrete Optimization Algorithms, Prentice-Hall, Englewood Cliffs 1983.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1992 Physica-Verlag Heidelberg
About this paper
Cite this paper
Dudek-Dyduch, E. (1992). Optimization of Discrete Manufacturing Processes — Branch and Bound Method. In: Gritzmann, P., Hettich, R., Horst, R., Sachs, E. (eds) Operations Research ’91. Physica-Verlag HD. https://doi.org/10.1007/978-3-642-48417-9_7
Download citation
DOI: https://doi.org/10.1007/978-3-642-48417-9_7
Publisher Name: Physica-Verlag HD
Print ISBN: 978-3-7908-0608-3
Online ISBN: 978-3-642-48417-9
eBook Packages: Springer Book Archive