An Optimal Algorithm to Find the Jump Number of Partially Ordered Sets

The jump number of a partially ordered set (poset) P isthe minimum number of incomparable adjacent pairs (jumps) in some linearextension of P. The problem of finding a linear extension of Pwith minimum number of jumps (jump number problem) is known to beNP-hard in general and, at the best of our knowledge, no exactalgorithm for general posets has been developed. In this paper, wegive examples of applications of this problem and propose for thegeneral case a new heuristic algorithm and an exactalgorithm. Performances of both algorithms are experimentallyevaluated on a set of randomly generated test problems.

[1]  Michael G. Norman,et al.  Models of machines and computation for mapping in multicomputers , 1993, CSUR.

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

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

[4]  Rainer Schrader,et al.  Minimizing Completion Time for a Class of Scheduling Problems , 1984, Inf. Process. Lett..

[5]  Michel Habib,et al.  NP-completeness properties about linear extensions , 1987 .

[6]  Samuel J. Raff,et al.  Routing and scheduling of vehicles and crews : The state of the art , 1983, Comput. Oper. Res..

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

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

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

[10]  Maciej M. Sysło,et al.  Minimizing the jump number for partially ordered sets: A graph-theoretic approach , 1984 .

[11]  Lucio Bianco,et al.  Exact and Heuristic Algorithms for the Jump Number Problem , 1995 .

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

[13]  Martin W. P. Savelsbergh,et al.  The General Pickup and Delivery Problem , 1995, Transp. Sci..

[14]  Charles J. Colbourn,et al.  Minimizing setups in ordered sets of fixed width , 1985 .

[15]  P. Winkler,et al.  Minimizing setups for cycle-free ordered sets , 1982 .

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

[17]  Randolph W. Hall,et al.  A Routing Model for Pickups and Deliveries: No Capacity Restrictions on the Secondary Items , 1993, Transp. Sci..

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

[19]  Maciej M. Syslo.  A Graph-Theoretic Approach to the Jump-Number Problem , 1985 .