Partially ordered knapsack and applications to scheduling

In the partially ordered knapsack problem (POK) we are given a set N of items and a partial order @?"P on N. Each item has a size and an associated weight. The objective is to pack a set N^'@?N of maximum weight in a knapsack of bounded size. N^' should be precedence-closed, i.e., be a valid prefix of @?"P. POK is a natural generalization, for which very little is known, of the classical Knapsack problem. In this paper we present both positive and negative results. We give an FPTAS for the important case of a two-dimensional partial order, a class of partial orders which is a substantial generalization of the series-parallel class, and we identify the first non-trivial special case for which a polynomial-time algorithm exists. Our results have implications for approximation algorithms for scheduling precedence-constrained jobs on a single machine to minimize the sum of weighted completion times, a problem closely related to POK.

[1]  Shimon Kogan,et al.  Hardness of approximation of the Balanced Complete Bipartite Subgraph problem , 2004 .

[2]  Hisao Tamaki,et al.  Greedily Finding a Dense Subgraph , 2000, J. Algorithms.

[3]  Gerhard J. Woeginger,et al.  Polynomial time approximation algorithms for machine scheduling: ten open problems , 1999 .

[4]  D. Hochbaum.  Approximating covering and packing problems: set cover, vertex cover, independent set, and related problems , 1996 .

[5]  A. Russell,et al.  The Minimum k-Colored Subgraph Problem in Haplotyping and DNA Primer Selection , 2004 .

[6]  Dieter Kratsch,et al.  Computing a Perfect Edge Without Vertex Elimination Ordering of a Chordal Bipartite Graph , 1995, Inf. Process. Lett..

[7]  A. Brandstädt,et al.  Graph Classes: A Survey , 1987 .

[8]  M. Yannakakis.  The Complexity of the Partial Order Dimension Problem , 1982 .

[9]  Fabián A. Chudak,et al.  Approximation Algorithms for Precedence-Constrained Scheduling Problems on Parallel Machines That Run at Fifferent Speeds (Extended Abstract) , 1997, SODA.

[10]  David P. Williamson,et al.  Two-dimensional Gantt charts and a scheduling algorithm of Lawler , 1999, SODA '99.

[11]  Robert E. Tarjan,et al.  Three Partition Refinement Algorithms , 1987, SIAM J. Comput..

[12]  Fabián A. Chudak,et al.  A half-integral linear programming relaxation for scheduling precedence-constrained jobs on a single machine , 1999, Oper. Res. Lett..

[13]  Rajeev Motwani,et al.  Precedence Constrained Scheduling to Minimize Sum of Weighted Completion Times on a Single Machine , 1999, Discret. Appl. Math..

[14]  Maurice Queyranne,et al.  Decompositions, Network Flows, and a Precedence Constrained Single-Machine Scheduling Problem , 2003, Oper. Res..

[15]  Oscar H. Ibarra,et al.  Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems , 1975, JACM.

[16]  José R. Correa,et al.  Single-Machine Scheduling with Precedence Constraints , 2005, Math. Oper. Res..

[17]  Ben Dushnik,et al.  Partially Ordered Sets , 1941 .

[18]  Nicolai N. Pisaruk,et al.  A fully combinatorial 2-approximation algorithm for precedence-constrained scheduling a single machine to minimize average weighted completion time , 2003, Discret. Appl. Math..

[19]  Subhash Khot.  Ruling Out PTAS for Graph Min-Bisection, Densest Subgraph and Bipartite Clique , 2004, FOCS.

[20]  Robert D. Carr,et al.  Strengthening integrality gaps for capacitated network design and covering problems , 2000, SODA '00.

[21]  Dorit S. Hochbaum,et al.  Approximation Algorithms for NP-Hard Problems , 1996 .

[22]  J. Vitter,et al.  Approximations with Minimum Packing Constraint Violation , 1992 .

[23]  D. S. Johnson,et al.  On Knapsacks, Partitions, and a New Dynamic Programming Technique for Trees , 1983, Math. Oper. Res..

[24]  Uriel Feige,et al.  Resolution lower bounds for the weak pigeon hole principle , 2002, Proceedings 17th IEEE Annual Conference on Computational Complexity.

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

[26]  Uriel Feige,et al.  The Dense k -Subgraph Problem , 2001, Algorithmica.

[27]  Dieter Kratsch,et al.  Treewidth of Chordal Bipartite Graphs , 1993, J. Algorithms.

[28]  Stavros G. Kolliopoulos,et al.  Partially-Ordered Knapsack and Applications to Scheduling , 2002, ESA.

[29]  Jeffrey B. Sidney,et al.  Decomposition Algorithms for Single-Machine Sequencing with Precedence Relations and Deferral Costs , 1975, Oper. Res..

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

[31]  Gerhard J. Woeginger.  On the approximability of average completion time scheduling under precedence constraints , 2003, Discret. Appl. Math..

[32]  M. R. Rao,et al.  Combinatorial Optimization , 1992, NATO ASI Series.

[33]  David B. Shmoys,et al.  Scheduling to Minimize Average Completion Time: Off-Line and On-Line Approximation Algorithms , 1997, Math. Oper. Res..