Summary
The jump number problem consists in determining a linear extension, of a partially ordered set (poset), with minimum number of jumps. The problem is known to be NP-hard for generical posets. In the paper we present an exact algorithm based on dynamic programming, and a heuristic algorithm for the jump number problem for general posets. Performance analysis of both algorithms are performed on a number of randomly generated partially ordered sets.
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
Ali H.H., Deogun J. S. (1990), A Polynomial Algorithm to Find the Jump Number of Interval Orders, Preprint, Univ. of Nebraska Lincoln.
Bianco L., Dell’Olmo P., Giordani S. (1994), Exact and Heuristic Algorithms for the Jump Number Problem, Tech. Rep. 376 of I. A.S.I. — C.N.R. Rome Italy.
Blazewicz J., Ecker K., Schmidt G., Weglarz J. (1993), Scheduling in Computer and Manufacturing Systems, Springer-Verlag.
Cogis O., Habib H. (1979), Nombre de Sauts et Graphes Série-parallèles, RAIRO Inform. Théor., 13, 3–18.
Dilworth R.P. (1950), A Decomposition Theorem for Partially Ordered Sets, Ann. of Math., 51, 161–166.
Faigle U., Schräder R. (1985), A Setup Heuristic for Interval Orders, Oper. Res. Letters, 4, 185–188.
Felsner S. (1990), A 3/2-Approximation Algorithm for the Jump Number of Interval Orders, Order, 6, 325–334.
Gierz G., Poguntke W. (1983), Minimizing Setups for Ordered Sets: a Linear Algebraic Approach, SIAM J. Alg. Disc. Meth., 4, 132–144.
Mitas J. (1991), Tackling the Jump Number Problem for Interval Orders, Order, 8, 115–132.
Moehring R.H. (1989), Computationally Tractable Classes of Ordered Sets, in: I. Rival (ed.) Algorithms and Order, 105–193.
Pulleyblank W.R. (1981), On Minimizing Setups in Precedence Constrained Scheduling, preliminary manuscript
Rival I. (1982), Optimal Linear Extensions by Interchanging Chains, Proc. Amer. Math. Soc., 89, 387–394.
Steiner G. (1990), On the Complexity of Dynamic Programming for Sequencing Problems with Precedence Constraints, Ann. Oper. Res., 26, 103–123.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1995 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bianco, L., Dell’Olmo, P., Giordani, S. (1995). Exact and Heuristic Algorithms for the Jump Number Problem. In: Derigs, U., Bachem, A., Drexl, A. (eds) Operations Research Proceedings 1994. Operations Research Proceedings, vol 1994. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-79459-9_27
Download citation
DOI: https://doi.org/10.1007/978-3-642-79459-9_27
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-58793-4
Online ISBN: 978-3-642-79459-9
eBook Packages: Springer Book Archive