The following pages link to (Q3031924):
Displaying 28 items.
- Improved approximation algorithms for non-preemptive multiprocessor scheduling with testing (Q2168774) (← links)
- Worst-case analysis for on-line service policies (Q2268767) (← links)
- Online scheduling of jobs with favorite machines (Q2289948) (← links)
- Tight lower bounds for semi-online scheduling on two uniform machines with known optimum (Q2323435) (← links)
- On-line booking policies and competitive analysis of medical examination in hospital (Q2336398) (← links)
- Online makespan minimization with parallel schedules (Q2362356) (← links)
- Separating online scheduling algorithms with the relative worst order ratio (Q2385472) (← 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)
- An efficient algorithm for bin stretching (Q2450663) (← links)
- Competitive online scheduling of perfectly malleable jobs with setup times (Q2467259) (← links)
- Load balancing of temporary tasks in the \(\ell _{p}\) norm (Q2503355) (← links)
- Semi-online scheduling jobs with tightly-grouped processing times on three identical machines (Q2565855) (← links)
- An Optimal Preemptive Algorithm for Online MapReduce Scheduling on Two Parallel Machines (Q4565266) (← links)
- Tight Bounds for Online Vector Scheduling (Q4620410) (← links)
- Online Order Scheduling Problem with the Same Order Size on Two Identical Machines (Q4978463) (← links)
- Online Makespan Scheduling with Job Migration on Uniform Machines (Q5009583) (← links)
- Randomized algorithms for that ancient scheduling problem (Q5096939) (← links)
- Semi-online scheduling with decreasing job sizes (Q5929138) (← links)
- Semi-on-line scheduling problems for maximizing the minimum machine completion time (Q5931905) (← links)
- Preemptive multiprocessor scheduling with rejection (Q5958131) (← links)
- On-line bin-stretching (Q5958712) (← links)
- An optimal online algorithm for scheduling two machines with release times (Q5958718) (← links)
- Semi-online scheduling with combined information on two identical machines in parallel (Q5963644) (← links)
- Exact algorithms for solving the constrained parallel-machine scheduling problems with divisible processing times and penalties (Q6046629) (← links)
- Semi-online early work maximization problems on two hierarchical uniform machines with partial information of processing time (Q6084675) (← links)
- Parallel solutions for preemptive makespan scheduling on two identical machines (Q6102847) (← links)
- Machine covering in the random-order model (Q6103518) (← links)
