Formulating the single machine sequencing problem with release dates as a mixed integer program
Discrete Applied Mathematics - Southampton conference on combinatorial optimization, April 1987
Scheduling to minimize average completion time: off-line and on-line approximation algorithms
Mathematics of Operations Research
Precedence constrained scheduling to minimize sum of weighted completion times on a single machine
Discrete Applied Mathematics
Two-Dimensional Gantt Charts and a Scheduling Algorithm of Lawler
SIAM Journal on Discrete Mathematics
Discrete Applied Mathematics
Single-Machine Scheduling with Precedence Constraints
Mathematics of Operations Research
Single machine precedence constrained scheduling is a vertex cover problem
ESA'06 Proceedings of the 14th conference on Annual European Symposium - Volume 14
Scheduling with Precedence Constraints of Low Fractional Dimension
IPCO '07 Proceedings of the 12th international conference on Integer Programming and Combinatorial Optimization
Integrality Property in Preemptive Parallel Machine Scheduling
CSR '09 Proceedings of the Fourth International Computer Science Symposium in Russia on Computer Science - Theory and Applications
Conditional hardness of precedence constrained scheduling on identical machines
Proceedings of the forty-second ACM symposium on Theory of computing
A constant factor approximation algorithm for generalized min-sum set cover
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Mathematics of Operations Research
On the Approximability of Single-Machine Scheduling with Precedence Constraints
Mathematics of Operations Research
Hardness of Precedence Constrained Scheduling on Identical Machines
SIAM Journal on Computing
Ranking with submodular valuations
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Approximating precedence-constrained single machine scheduling by coloring
APPROX'06/RANDOM'06 Proceedings of the 9th international conference on Approximation Algorithms for Combinatorial Optimization Problems, and 10th international conference on Randomization and Computation
List scheduling in order of α-points on a single machine
Efficient Approximation and Online Algorithms
The Power of Preemption on Unrelated Machines and Applications to Scheduling Orders
Mathematics of Operations Research
LAD models, trees, and an analog of the fundamental theorem of arithmetic
Discrete Applied Mathematics
Hi-index | 0.04 |
We consider the scheduling problem of minimizing the average weighted job completion time on a single machine under precedence constraints. We show that this problem with arbitrary job weights, the special case of the problem where all job weights are one, and several other special cases of the problem all have the same approximability threshold with respect to polynomial time approximation algorithms. Moreover, for the special case of interval order precedence constraints and for the special case of convex bipartite precedence constraints, we give a polynomial time approximation algorithm with worst case performance guarantee arbitrarily close to the golden ratio 12(1+5)~1.61803.