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 advance the state-of-the-art for the problem through both positive and negative results. We give an FPTAS for the important case of a 2-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. We also characterize cases where the natural linear relaxation for POK is useful for approximation and we demonstrate its limitations. 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]  Jeffrey B. Sidney,et al.  Decomposition Algorithms for Single-Machine Sequencing with Precedence Relations and Deferral Costs , 1975, Oper. Res..

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

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

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

[5]  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..

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

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

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

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

[10]  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..

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

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

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

[14]  William J. Cook,et al.  Combinatorial optimization , 1997 .

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

[16]  Fabián A. Chudak,et al.  Approximation algorithms for precedence-constrained scheduling problems on parallel machines that run at different speeds , 1997, SODA '97.

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

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

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

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

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

[22]  Gerhard J. Woeginger,et al.  On the approximability of average completion time scheduling under precedence constraints , 2001, Discret. Appl. Math..

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

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

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