论文信息 - Exact and Heuristic Algorithms for the Jump Number Problem

Exact and Heuristic Algorithms for the Jump Number Problem

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.

[1] Jacek Blazewicz,et al. Scheduling in Computer and Manufacturing Systems , 1990 .

[2] I. Rival. Algorithms and Order , 1988 .

[3] Jutta Mitas. Tackling the jump number of interval orders , 1991 .

[4] George Steiner,et al. On the complexity of dynamic programming for sequencing problems with precedence constraints , 1991 .

[5] Gerhard Gierz,et al. Minimizing Setups for Ordered Sets: A Linear Algebraic Approach , 1983 .

[6] Michel Habib,et al. Nombre de sauts et graphes série-parallèles , 1979, RAIRO Theor. Informatics Appl..

[7] R. P. Dilworth,et al. A DECOMPOSITION THEOREM FOR PARTIALLY ORDERED SETS , 1950 .

[8] Rolf H. Möhring,et al. Computationally Tractable Classes of Ordered Sets , 1989 .

[9] Stefan Felsner. A 3/2-approximation algorithm for the jump number of interval orders , 1990 .

[10] Rainer Schrader,et al. A setup heuristic for interval orders , 1985 .

[11] Ivan Rival. Optimal linear extensions by interchanging chains , 1983 .