The following pages link to (Q4535067):
Displaying 14 items.
- Optimal restricted due date assignment in scheduling (Q322834) (← links)
- Scheduling results applicable to decision-theoretic troubleshooting (Q473374) (← links)
- Approximability of average completion time scheduling on unrelated machines (Q507314) (← links)
- Optimal collusion-resistant mechanisms with verification (Q2016253) (← links)
- Approximation algorithms for scheduling problems with a modified total weighted tardiness objective (Q2465959) (← links)
- Designing PTASs for MIN-SUM scheduling problems (Q2489956) (← links)
- The efficiency-fairness balance of round robin scheduling (Q2670464) (← links)
- Fair Scheduling via Iterative Quasi-Uniform Sampling (Q3304734) (← links)
- Scheduling Bidirectional Traffic on a Path (Q3448803) (← links)
- Online Appointment Scheduling in the Random Order Model (Q3452831) (← links)
- Lift-and-Round to Improve Weighted Completion Time on Unrelated Machines (Q4997316) (← links)
- Scheduling to Minimize Total Weighted Completion Time via Time-Indexed Linear Programming Relaxations (Q5117378) (← links)
- Weighted Completion Time Minimization for Unrelated Machines via Iterative Fair Contention Resolution (Q5146966) (← links)
- Approximating weighted completion time via stronger negative correlation (Q6620463) (← links)
