The following pages link to (Q2768123):
Displayed 11 items.
- 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)
- 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)
- 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)
- Online Throughput Maximization on Unrelated Machines: Commitment is No Burden (Q6075745) (← links)