Pages that link to "Item:Q3190699"
From MaRDI portal
The following pages link to The Power of Reordering for Online Minimum Makespan Scheduling (Q3190699):
Displayed 24 items.
- Improved semi-online makespan scheduling with a reordering buffer (Q396624) (← links)
- Semi-online scheduling revisited (Q442235) (← links)
- Online scheduling with one rearrangement at the end: revisited (Q456073) (← links)
- Online scheduling with rejection and reordering: exact algorithms for unit size jobs (Q489737) (← links)
- Semi-online preemptive scheduling: one algorithm for all variants (Q537921) (← links)
- Online scheduling with rearrangement on two related machines (Q627161) (← links)
- Optimal algorithms for online scheduling with bounded rearrangement at the end (Q653317) (← links)
- Online scheduling with a buffer on related machines (Q711400) (← links)
- Scheduling with testing on multiple identical parallel machines (Q832831) (← links)
- Online makespan minimization with budgeted uncertainty (Q832833) (← links)
- A survey on makespan minimization in semi-online environments (Q1617278) (← links)
- Scheduling on parallel identical machines with late work criterion: offline and online cases (Q1702733) (← links)
- Scheduling In the random-order model (Q1979454) (← links)
- Semi-online algorithms for hierarchical scheduling on three parallel machines with a buffer size of 1 (Q1980488) (← links)
- Online makespan scheduling with job migration on uniform machines (Q2067667) (← links)
- A 2-competitive largest job on least loaded machine online algorithm based on the multi list scheduling model (Q2079980) (← links)
- Competitive analysis of online machine rental and online parallel machine scheduling problems with workload fence (Q2165267) (← links)
- Tight bounds for online coloring of basic graph classes (Q2223701) (← links)
- Online makespan minimization with parallel schedules (Q2362356) (← links)
- On the value of job migration in online makespan minimization (Q2408930) (← links)
- Semi-online scheduling: a survey (Q2669808) (← links)
- (Q5009506) (← links)
- Online Makespan Scheduling with Job Migration on Uniform Machines (Q5009583) (← links)
- Tight Bounds for Online Coloring of Basic Graph Classes (Q5111690) (← links)