On the Approximability of Average Completion Time Scheduling under Precedence Constraints
ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
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 - Special issue: The second international colloquium, "journées de l'informatique messine"
On the relationship between combinatorial and LP-based lower bounds for NP-hard scheduling problems
Theoretical Computer Science - Approximation and online algorithms
Partially ordered knapsack and applications to scheduling
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
On the approximability of average completion time scheduling under precedence constraints
Discrete Applied Mathematics
Conditional hardness of precedence constrained scheduling on identical machines
Proceedings of the forty-second ACM symposium on Theory of computing
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
List scheduling in order of α-points on a single machine
Efficient Approximation and Online Algorithms
Asymptotically optimal schedules for single-server flow shop problems with setup costs and times
Operations Research Letters
Dual techniques for scheduling on a machine with varying speed
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part I
| Hi-index | 0.00 |
In this note we give an alternate proof that a scheduling algorithm of Lawler [E. L. Lawler, Ann. Discrete Math., 2 (1978), pp. 75--90, E. L. Lawler and J. K. Lenstra, in Ordered Sets, I. Rival, ed., D. Reidel, 1982, pp. 655--675] finds the optimal solution for the scheduling problem $1 | prec | \sum_j w_j C_j$ when the precedence constraints are series-parallel. We do this by using a linear programming formulation of $1 | prec | \sum_j w_j C_j$ introduced by Queyranne and Wang. [ Math. Oper. Res., 16 (1991), pp. 1--20]. Queyranne and Wang proved that their formulation completely describes the scheduling polyhedron in the case of series-parallel constraints; a by-product of our proof of correctness of Lawler's algorithm is an alternate proof of this fact. In the course of our proof it is helpful to use what might be called two-dimensional (2D) Gantt charts. We think these may find independent use, and to illustrate this we show that some recent work in the area becomes transparent using 2D Gantt charts.