Pages that link to "Item:Q1327292"
From MaRDI portal
The following pages link to A better lower bound for on-line scheduling (Q1327292):
Displaying 30 items.
- A lower bound for randomized on-line multiprocessor scheduling (Q287130) (← links)
- Semi-online scheduling problems on a small number of machines (Q398877) (← links)
- Semi-online scheduling revisited (Q442235) (← links)
- Improved bounds for online scheduling with eligibility constraints (Q719259) (← links)
- Scheduling with testing on multiple identical parallel machines (Q832831) (← links)
- Online makespan minimization with budgeted uncertainty (Q832833) (← links)
- List's worst-average-case or WAC ratio (Q835596) (← links)
- Optimal on-line algorithms to minimize makespan on two machines with resource augmentation (Q927393) (← links)
- Semi on-line algorithms for the partition problem (Q1267197) (← links)
- New algorithms for related machines with temporary jobs. (Q1588054) (← links)
- On-line scheduling revisited (Q1592757) (← links)
- A survey on makespan minimization in semi-online environments (Q1617278) (← links)
- Scheduling In the random-order model (Q1979454) (← 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)
- Online makespan minimization with parallel schedules (Q2362356) (← links)
- Improved lower bounds for the online bin stretching problem (Q2399609) (← links)
- Approximation and online algorithms for multidimensional bin packing: a survey (Q2400930) (← links)
- On the value of job migration in online makespan minimization (Q2408930) (← links)
- Load balancing of temporary tasks in the \(\ell _{p}\) norm (Q2503355) (← links)
- Tight Bounds for Online Vector Scheduling (Q4620410) (← links)
- Online Makespan Scheduling with Job Migration on Uniform Machines (Q5009583) (← links)
- On two dimensional packing (Q5054823) (← links)
- Randomized algorithms for that ancient scheduling problem (Q5096939) (← links)
- Approximating the Optimal Algorithm for Online Scheduling Problems via Dynamic Programming (Q5245846) (← links)
- On-line algorithms for packing rectangles into several strips (Q5439071) (← links)
- Semi-online scheduling with decreasing job sizes (Q5929138) (← links)
- Preemptive multiprocessor scheduling with rejection (Q5958131) (← links)
- An optimal online algorithm for scheduling two machines with release times (Q5958718) (← links)
- Machine covering in the random-order model (Q6103518) (← links)
