Two-Dimensional Gantt Charts and a Scheduling Algorithm of Lawler
From MaRDI portal
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; zbMATH DE number 4137518
Cited in
(14)- Single machine precedence constrained scheduling is a Vertex cover problem
- Gantt charts: A centenary appreciation.
- On the approximability of average completion time scheduling under precedence constraints.
- Optimal algorithms for scheduling under time-of-use tariffs
- Scheduling meets n-fold integer programming
- 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 relationship between combinatorial and LP-based lower bounds for NP-hard scheduling problems
- Dual techniques for scheduling on a machine with varying speed
- scientific article; zbMATH DE number 1305426 (Why is no real title available?)
- SPT optimality (mostly) via linear programming
- Total completion time scheduling under scenarios
- Total completion time scheduling under scenarios
- Partially ordered knapsack and applications to scheduling
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)
