Pages that link to "Item:Q2768123"
From MaRDI portal
The following pages link to On-line scheduling to maximize task completions. (Q2768123):
Displaying 16 items.
- Adaptive online scheduling of tasks with anytime property on heterogeneous resources (Q342556) (← links)
- Temperature aware online algorithms for scheduling equal length jobs (Q388098) (← links)
- Online scheduling of weighted equal-length jobs with hard deadlines on parallel machines (Q632642) (← links)
- On the competitiveness of on-line real-time task scheduling (Q1206445) (← links)
- On-line scheduling with tight deadlines. (Q1401244) (← links)
- Preemptive scheduling in overloaded systems. (Q1401985) (← links)
- Online scheduling of jobs with kind release times and deadlines on a single machine (Q2422652) (← links)
- Online scheduling of bounded length jobs to maximize throughput (Q2434304) (← links)
- How to whack moles (Q2503357) (← links)
- Performance guarantee for online deadline scheduling in the presence of overload (Q2768377) (← links)
- Temperature Aware Online Algorithms for Scheduling Equal Length Jobs (Q3004686) (← links)
- Improved Online Scheduling in Maximizing Throughput of Equal Length Jobs (Q3007646) (← links)
- A Lower Bound for Scheduling of Unit Jobs with Immediate Decision on Parallel Machines (Q3602828) (← links)
- A general framework for handling commitment in online throughput maximization (Q5918914) (← links)
- On-line scheduling on a single machine: Maximizing the number of early jobs (Q5929136) (← links)
- Maximizing the number of rides served for time-limited Dial-a-Ride* (Q6661115) (← links)