Pages that link to "Item:Q5388006"
From MaRDI portal
The following pages link to Approximation Algorithms for the Job Interval Selection Problem and Related Scheduling Problems (Q5388006):
Displayed 26 items.
- Non-preemptive speed scaling (Q398859) (← links)
- Bandwidth allocation in cellular networks with multiple interferences (Q494422) (← links)
- Improving LTL truck load utilization on line (Q531465) (← links)
- Exact algorithms for a generalization of the order acceptance and scheduling problem in a single-machine environment (Q709154) (← links)
- Efficient job scheduling algorithms with multi-type contentions (Q813335) (← links)
- Interval scheduling and colorful independent sets (Q892898) (← links)
- Scheduling with a minimum number of machines (Q1015305) (← links)
- Bandwidth-constrained allocation in grid computing (Q1018048) (← links)
- Priority algorithms for the subset-sum problem (Q1029701) (← links)
- Balanced splitting on weighted intervals (Q1785388) (← links)
- Inverse interval scheduling via reduction on a single machine (Q2158006) (← links)
- On the fine-grained parameterized complexity of partial scheduling to minimize the makespan (Q2161009) (← links)
- A polynomial-time approximation scheme for the airplane refueling problem (Q2327962) (← links)
- Grasp and delivery for moving objects on broken lines (Q2481562) (← links)
- On Lagrangian relaxation for constrained maximization and reoptimization problems (Q2664005) (← links)
- Approximating Interval Selection on Unrelated Machines with Unit-Length Intervals and Cores (Q2835690) (← links)
- Min Sum Edge Coloring in Multigraphs Via Configuration LP (Q3503859) (← links)
- On Lagrangian Relaxation and Subset Selection Problems (Q3602837) (← 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)
- (Q6065401) (← links)
- Maximizing Throughput in Flow Shop Real-Time Scheduling (Q6084409) (← links)
- (Q6089672) (← links)
- The complexity of the timetable‐based railway network design problem (Q6196872) (← links)