Pages that link to "Item:Q1806343"
From MaRDI portal
The following pages link to On the approximability of an interval scheduling problem (Q1806343):
Displayed 15 items.
- Approximation algorithms for variable voltage processors: min energy, max throughput and online heuristics (Q553339) (← links)
- Fixed interval scheduling: models, applications, computational complexity and algorithms (Q859906) (← links)
- Bicriteria scheduling for contiguous and non contiguous parallel tasks (Q940878) (← links)
- Scheduling with a minimum number of machines (Q1015305) (← links)
- Online real-time preemptive scheduling of jobs with deadlines on multiple machines (Q1348736) (← links)
- Approximation algorithms for time-dependent orienteering. (Q1853044) (← links)
- On the complexity of the independent set problem in triangle graphs (Q2275391) (← links)
- AFSCN scheduling: how the problem and solution have evolved (Q2473179) (← links)
- Grasp and delivery for moving objects on broken lines (Q2481562) (← links)
- Runway sequencing with holding patterns (Q2482798) (← links)
- DECOMPOSITION ALGORITHMS FOR THE INTERVAL SCHEDULING PROBLEM (Q3052722) (← links)
- Primal-dual approximation algorithms for a packing-covering pair of problems (Q3148377) (← links)
- Working time constraints in operational fixed job scheduling (Q3163130) (← links)
- A fixed job scheduling problem with machine-dependent job weights (Q3183761) (← links)
- Approximation Algorithms for Variable Voltage Processors: Min Energy, Max Throughput and Online Heuristics (Q3652225) (← links)