Abstract
We propose a technique for constructing all optimal permutations for the problem of minimizing so-called strong priority-generating functions under precedence constraints. A similar problem was considered in [3] where a decomposition scheme for finding all optimal solutions was developed. Nevertheless it is not clear how to apply this scheme efficiently for concrete problems. Our technique allows to develope efficient algorithms. The time complexity of the corresponding algorithm for series-parallel precedence constraints, for example, is O(n 2).
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.
Similar content being viewed by others
References
Brucker, P.: Scheduling algorithms. Springer (1998) Berlin.
Lawler, E.L., Lenstra, J.K., Rinnooy Kan, A.H.G., Shmoys, D.B.: Sequencing and scheduling: algorithms and complexity. In: Handbook in Operations Research and Management Science, Vol.4, Logistics of Production and Inventory, Graves S.C, Rinnooy Kan A.H.G., Zipkin P.H. (eds.) Amsterdam, North-Holland (1993) 445–522.
Monma, C.L., Sidney, J.B.: Optimal sequencing via modular decomposition: characterization of sequencing functions. Math. Oper. Res. 12 (1987) 22–31.
Tanaev, V.S., Gordon, V.S., Shafransky, Y.M.: Scheduling Theory. Single-Stage Systems. Kluwer academic publishers (1994) Dordrecht-Boston-London.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Shafransky, Y.M., Tuzikov, A.V. (2000). Sequencing under Precedence Constraints: Construction of All Optimal Permutations. In: Inderfurth, K., Schwödiauer, G., Domschke, W., Juhnke, F., Kleinschmidt, P., Wäscher, G. (eds) Operations Research Proceedings 1999. Operations Research Proceedings 1999, vol 1999. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-58300-1_63
Download citation
DOI: https://doi.org/10.1007/978-3-642-58300-1_63
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-67094-0
Online ISBN: 978-3-642-58300-1
eBook Packages: Springer Book Archive