Single-machine scheduling polyhedra with precedence constraints
Mathematics of Operations Research
Scheduling to minimize average completion time: off-line and on-line approximation algorithms
Mathematics of Operations Research
Scheduling to minimize average completion time: off-line and on-line algorithms
Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
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
Proceedings of the 5th International IPCO Conference on Integer Programming and Combinatorial Optimization
Random-Based Scheduling: New Approximations and LP Lower Bounds
RANDOM '97 Proceedings of the International Workshop on Randomization and Approximation Techniques in Computer Science
Partially-Ordered Knapsack and Applications to Scheduling
ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
On the approximability of average completion time scheduling under precedence constraints
Discrete Applied Mathematics
Operations Research Letters
Partially ordered knapsack and applications to scheduling
Discrete Applied Mathematics
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
Approximating Single Machine Scheduling with Scenarios
APPROX '08 / RANDOM '08 Proceedings of the 11th international workshop, APPROX 2008, and 12th international workshop, RANDOM 2008 on Approximation, Randomization and Combinatorial Optimization: Algorithms and Techniques
The Power of Preemption on Unrelated Machines and Applications to Scheduling Orders
APPROX '09 / RANDOM '09 Proceedings of the 12th International Workshop and 13th International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
Conditional hardness of precedence constrained scheduling on identical machines
Proceedings of the forty-second ACM symposium on Theory of computing
Mathematics of Operations Research
Vertex cover in graphs with locally few colors
ICALP'11 Proceedings of the 38th international colloquim conference on Automata, languages and programming - Volume Part I
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
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
The feedback arc set problem with triangle inequality is a vertex cover problem
LATIN'12 Proceedings of the 10th Latin American international conference on Theoretical Informatics
The Power of Preemption on Unrelated Machines and Applications to Scheduling Orders
Mathematics of Operations Research
Vertex cover in graphs with locally few colors
Information and Computation
Hi-index | 0.00 |
We discuss the problem of sequencing precedence-constrained jobs on a single machine to minimize the average weighted completion time. This problem has attracted much attention in the mathematical programming community since Sidney's pioneering work in 1975 (Sidney, J. B. 1975. Decomposition algorithms for single machine scheduling with precedence relations and deferral costs. Operations Research23 283-298). We look at the problem from a polyhedral perspective and uncover a relation between Sidney's decomposition theorem and different linear programming relaxations. More specifically, we present a generalization of Sidney's result, which particularly allows us to reason that virtually all known 2-approximation algorithms are consistent with his decomposition. Moreover, we establish a connection between the single-machine scheduling problem and the vertex cover problem. Indeed, in the special case of series-parallel precedence constraints, we prove that the sequencing problem can be seen as a special case of the vertex cover problem. We also argue that this result is true for general precedence constraints if one can show that a certain integer program represents a valid formulation of the sequencing problem. Finally, we give a 3/2-approximation algorithm for two-dimensional partial orders, and we also provide a characterization of the active inequalities of a linear programming relaxation in completion time variables.