Pages that link to "Item:Q1806343"
From MaRDI portal
The following pages link to On the approximability of an interval scheduling problem (Q1806343):
Displayed 35 items.
- Heuristics for the time dependent team orienteering problem: application to tourist route planning (Q337623) (← links)
- Online selection of intervals and \(t\)-intervals (Q391644) (← links)
- Improving fleet utilization for carriers by interval scheduling (Q439488) (← links)
- Bandwidth allocation in cellular networks with multiple interferences (Q494422) (← links)
- Approximation algorithms for variable voltage processors: min energy, max throughput and online heuristics (Q553339) (← links)
- Dynamic algorithms for multimachine interval scheduling through analysis of idle intervals (Q727980) (← links)
- Fixed interval scheduling: models, applications, computational complexity and algorithms (Q859906) (← links)
- Interval scheduling and colorful independent sets (Q892898) (← 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)
- Improved algorithms for resource allocation under varying capacity (Q1617284) (← links)
- Winner determination in geometrical combinatorial auctions (Q1698906) (← links)
- Complex-demand scheduling problem with application in smart grid (Q1727389) (← links)
- Balanced splitting on weighted intervals (Q1785388) (← links)
- Approximation algorithms for time-dependent orienteering. (Q1853044) (← links)
- Single-machine scheduling with release times, deadlines, setup times, and rejection (Q2030718) (← links)
- Interval scheduling with economies of scale (Q2108158) (← links)
- Inverse interval scheduling via reduction on a single machine (Q2158006) (← links)
- Primal-dual analysis for online interval scheduling problems (Q2182859) (← 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)
- Approximating Interval Selection on Unrelated Machines with Unit-Length Intervals and Cores (Q2835690) (← 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)
- The Maximum Equality-Free String Factorization Problem: Gaps vs. No Gaps (Q3297782) (← links)
- Approximation Algorithms for Variable Voltage Processors: Min Energy, Max Throughput and Online Heuristics (Q3652225) (← links)
- Breaking 1 - 1/e Barrier for Nonpreemptive Throughput Maximization (Q5130573) (← links)
- The temporal explorer who returns to the base (Q5918316) (← links)
- Throughput scheduling with equal additive laxity (Q5918523) (← links)
- Throughput scheduling with equal additive laxity (Q5925675) (← links)