Pages that link to "Item:Q5175956"
From MaRDI portal
The following pages link to Algorithms for minimizing weighted flow time (Q5175956):
Displaying 31 items.
- Online scheduling to minimize maximum weighted flow-time on a bounded parallel-batch machine (Q829170) (← links)
- Online weighted flow time and deadline scheduling (Q849627) (← links)
- Scheduling and fixed-parameter tractability (Q896271) (← links)
- Non-clairvoyant scheduling for weighted flow time (Q1014388) (← links)
- Improved lower bounds for online scheduling to minimize total stretch (Q1680548) (← links)
- How unsplittable-flow-covering helps scheduling with job-dependent cost functions (Q1751090) (← links)
- Lower bounds for on-line single-machine scheduling. (Q1874403) (← links)
- An optimal online algorithm for single-processor scheduling problem with learning effect (Q2079858) (← links)
- Non-clairvoyantly scheduling to minimize convex functions (Q2319644) (← links)
- Improved multi-processor scheduling for flow time and energy (Q2434271) (← links)
- Greedy multiprocessor server scheduling (Q2466596) (← links)
- Designing PTASs for MIN-SUM scheduling problems (Q2489956) (← links)
- New resource augmentation analysis of the total stretch of srpt and SJF in multiprocessor scheduling (Q2503312) (← links)
- Approximating total flow time on parallel machines (Q2641865) (← links)
- From Preemptive to Non-preemptive Scheduling Using Rejections (Q2817893) (← links)
- Minimizing Average Flow-Time (Q3644722) (← links)
- (Q3683851) (← links)
- (Q4471337) (← links)
- (Q4633939) (← links)
- Energy-efficient algorithms for flow time minimization (Q4962689) (← links)
- Fixed-Parameter Approximation Schemes for Weighted Flowtime. (Q5009522) (← links)
- Online Non-Preemptive Scheduling to Minimize Weighted Flow-time on Unrelated Machines (Q5009625) (← links)
- Algorithms for Flows over Time with Scheduling Costs (Q5041740) (← links)
- An Optimal Control Framework for Online Job Scheduling with General Cost Functions (Q5058033) (← links)
- Constant Factor Approximation Algorithm for Weighted Flow-Time on a Single Machine in PseudoPolynomial Time (Q5129231) (← links)
- (Q5743472) (← links)
- Joint replenishment meets scheduling (Q6102849) (← links)
- Constant Factor Approximation Algorithm for Weighted Flow-Time on a Single Machine in PseudoPolynomial Time (Q6139826) (← links)
- A best possible online algorithm for minimizing the total completion time and the total soft penalty cost (Q6181379) (← links)
- Two-Agent Scheduling with Resource Augmentation on Multiple Machines (Q6487363) (← links)
- A scheduling framework for distributed key-value stores and its application to tail latency minimization (Q6547138) (← links)
