Two-Dimensional Gantt Charts and a Scheduling Algorithm of Lawler
DOI10.1137/S0895480197330254zbMATH Open1054.90032OpenAlexW2034689708MaRDI QIDQ4490785FDOQ4490785
Authors: Michel X. Goemans, David P. Williamson
Publication date: 20 July 2000
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/s0895480197330254
Recommendations
- Scheduling Graphs on Two Processors
- scientific article; zbMATH DE number 613300
- A Graphical Foundation for Schedules
- Two-phase heuristics for scheduling of multiple projects
- TWO PRECEDENCE-RELATED TASK-SCHEDULING ALGORITHMS
- Two coNP-complete schedule analysis problems
- A two-pass scheduling algorithm for parallel programs
- On Approximation Algorithms for Two-Stage Scheduling Problems
- scientific article
Linear programming (90C05) Analysis of algorithms and problem complexity (68Q25) Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27)
Cited In (12)
- Total completion time scheduling under scenarios
- SPT optimality (mostly) via linear programming
- Scheduling meets \(n\)-fold integer programming
- On the relationship between combinatorial and LP-based lower bounds for NP-hard scheduling problems
- Asymptotically optimal schedules for single-server flow shop problems with setup costs and times
- The constrained minimum weighted sum of job completion times problem
- On the approximability of average completion time scheduling under precedence constraints.
- Dual techniques for scheduling on a machine with varying speed
- Gantt charts: A centenary appreciation.
- Single machine precedence constrained scheduling is a Vertex cover problem
- Partially ordered knapsack and applications to scheduling
- Optimal algorithms for scheduling under time-of-use tariffs
This page was built for publication: Two-Dimensional Gantt Charts and a Scheduling Algorithm of Lawler
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4490785)