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

Authors:
L. Bianco;P. Dell‘olmo;S. Giordani
Affiliations:
I.A.S.I., C.N.R., Viale Manzoni, 30, I-00185 Rome, Dept. of Computer Science, Systems & Production, Univ. of Rome “Tor Vergata”;Dept. of Computer Science, Systems & Production, Univ. of Rome “Tor Vergata”, Viale della Ricerca Scientifica, I-00133 Rome;Centro “Vito Volterra”, Univ. of Rome “Tor Vergata”
Venue:
Computational Optimization and Applications
Year:
1997

Citing 3
Cited 0

Minimizing completion time for a class of scheduling problems

Information Processing Letters
On the complexity of dynamic programming for sequencing problems with precedence constraints

Annals of Operations Research
Models of machines and computation for mapping in multicomputers

ACM Computing Surveys (CSUR)

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.