Pages that link to "Item:Q4268700"
From MaRDI portal
The following pages link to Approximability and Nonapproximability Results for Minimizing Total Flow Time on a Single Machine (Q4268700):
Displaying 16 items.
- Single machine batch scheduling with release times and delivery costs (Q398839) (← links)
- Temperature aware online algorithms for minimizing flow time (Q501653) (← links)
- Improving the preemptive bound for the one-machine dynamic total completion time scheduling problem. (Q1413906) (← links)
- Randomized algorithms for on-line scheduling problems: How low can't you go? (Q1612009) (← links)
- Managing the ship movements in the Port of Venice (Q1642949) (← links)
- Coupling genetic local search and recovering beam search algorithms for minimizing the total completion time in the single machine scheduling problem subject to release dates (Q1762109) (← links)
- SPT is optimally competitive for uniprocessor flow (Q2390257) (← links)
- From Preemptive to Non-preemptive Scheduling Using Rejections (Q2817893) (← links)
- Temperature Aware Online Algorithms for Minimizing Flow Time (Q4922110) (← links)
- Non-Preemptive Flow-Time Minimization via Rejections (Q5002748) (← links)
- Fixed-Parameter Approximation Schemes for Weighted Flowtime. (Q5009522) (← links)
- Constant Factor Approximation Algorithm for Weighted Flow-Time on a Single Machine in PseudoPolynomial Time (Q5129231) (← 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)
- A scheduling framework for distributed key-value stores and its application to tail latency minimization (Q6547138) (← links)
