Transversal Graphs for Partially Ordered Sets: Sequencing, Merging and Scheduling Problems

This paper introduces an approach to solving combinatorial optimization problems on partially ordered sets by the reduction to searching source-sink paths in the related transversal graphs. Different techniques are demonstrated in application to finding consistent supersequences, merging partially ordered sets, and machine scheduling with precedence constraints. Extending the approach to labeled partially ordered sets we also propose a solution for the smallest superplan problem and show its equivalence to the well studied coarsest regular refinement problem. For partially ordered sets of a fixed width the number of vertices in their transversal graphs is polynomial, so the reduction allows us easily to establish that many related problems are solvable in polynomial or pseudopolynomial time. For example, we establish that the longest consistent supersequence problem with a fixed number of given strings can be solved in polynomial time, and that the precedence-constrained release-date maximum- or total-cost preemptive or nonpreemptive job-shop scheduling problem with a fixed number of jobs can be solved in pseudopolynomial time. We also show that transversal graphs can be used to generalize and strengthen similar results obtained earlier by dynamic programming.

[1]  M. W. Du,et al.  New Algorithms for the LCS Problem , 1984, J. Comput. Syst. Sci..

[2]  A. Apostolico.  Remark on Hsu-Du New Algorithm for the LCS Problem , 1985 .

[3]  Eugene L. Lawler,et al.  Sequencing and scheduling: algorithms and complexity , 1989 .

[4]  Peter Brucker,et al.  Scheduling Algorithms , 1995 .

[5]  Robert W. Irving,et al.  Two Algorithms for the Longest Common Subsequence of Three (or More) Strings , 1992, CPM.

[6]  Stephen Y. Itoga.  The string merging problem , 1981, BIT.

[7]  Peter Brucker,et al.  A polynomial algorithm for the two machine job-shop scheduling problem with a fixed number of jobs , 1994 .

[8]  V. G. Timkovskii.  Complexity of common subsequence and supersequence problems and related problems , 1989 .

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

[10]  Y. Sotskov,et al.  The complexity of shop-scheduling problems with two or three jobs , 1991 .

[11]  Campbell Fraser.  Consistent Subsequences and Supersequences , 1996, Theor. Comput. Sci..

[12]  Qiang Yang,et al.  Theory and Algorithms for Plan Merging , 1992, Artif. Intell..

[13]  Louxin Zhang.  On the Approximation of Longest Common Nonsupersequences and Shortest Common Nonsubsequences , 1995, Theor. Comput. Sci..

[14]  Martin Middendorf.  On Finding Minimal, Maximal, and Consistent Sequences over a Binary Alphabet , 1995, Theor. Comput. Sci..

[15]  Martin Middendorf,et al.  Maximal Common Subsequences and Minimal Common Supersequences , 1996, Inf. Comput..

[16]  Hiroshi Imai,et al.  The Longest Common Subsequence Problem for Small Alphabet Size Between Many Strings , 1992, ISAAC.

[17]  Peter Brucker,et al.  Polynomial algorithms for resource-constrained and multiprocessor task scheduling problems , 1996 .

[18]  Peter Brucker,et al.  Preemptive job-shop scheduling problems with a fixed number of jobs , 1999, Math. Methods Oper. Res..

[19]  Tao Jiang,et al.  On the Complexity of Learning Strings and Sequences , 1993, Theor. Comput. Sci..

[20]  Vadim G. Timkovsky,et al.  String Noninclusion Optimization Problems , 1998, SIAM J. Discret. Math..

[21]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .