The following pages link to On-line scheduling revisited (Q1592757):
Displaying 50 items.
- A case study on the application of an approximated hypercube model to emergency medical systems management (Q300849) (← links)
- Semi-online scheduling problems on a small number of machines (Q398877) (← links)
- Lower bounds for online makespan minimization on a small number of related machines (Q398887) (← links)
- New upper and lower bounds for online scheduling with machine cost (Q429648) (← links)
- Semi-online scheduling revisited (Q442235) (← links)
- Robust algorithms for preemptive scheduling (Q472464) (← links)
- Online scheduling with rejection and reordering: exact algorithms for unit size jobs (Q489737) (← links)
- Online bin stretching with bunch techniques (Q497684) (← links)
- On robust online scheduling algorithms (Q539452) (← links)
- Semi-on-line multiprocessor scheduling with given total processing time (Q557814) (← links)
- Online hierarchical scheduling: an approach using mathematical programming (Q621843) (← links)
- Online scheduling with rearrangement on two related machines (Q627161) (← links)
- Online scheduling with rejection and withdrawal (Q650898) (← 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)
- Semi on-line scheduling on three processors with known sum of the tasks (Q835557) (← links)
- List's worst-average-case or WAC ratio (Q835596) (← links)
- Online parallel machines scheduling with two hierarchies (Q837151) (← links)
- Scheduling web advertisements: a note on the minspace problem (Q880489) (← links)
- Scheduling parallel jobs to minimize the makespan (Q880560) (← links)
- An efficient algorithm for semi-online multiprocessor scheduling with given total processing time (Q906558) (← links)
- Optimal on-line algorithms to minimize makespan on two machines with resource augmentation (Q927393) (← links)
- Online scheduling with reassignment (Q935241) (← links)
- On-line scheduling of multi-core processor tasks with virtualization (Q991470) (← links)
- Preemptive online scheduling: Optimal algorithms for all speeds (Q1016520) (← links)
- Priority algorithms for the subset-sum problem (Q1029701) (← links)
- A survey on makespan minimization in semi-online environments (Q1617278) (← links)
- Tight upper bounds for semi-online scheduling on two uniform machines with known optimum (Q1642847) (← links)
- Improved lower bounds for online scheduling to minimize total stretch (Q1680548) (← links)
- Algorithms better than LPT for semi-online scheduling with decreasing processing times (Q1758275) (← links)
- Minimizing the maximum starting time on-line (Q1763375) (← links)
- Pseudo lower bounds for online parallel machine scheduling (Q1785411) (← links)
- Offline file assignments for online load balancing (Q1944067) (← links)
- Scheduling In the random-order model (Q1979454) (← links)
- An improved parametric algorithm on two-machine scheduling with given lower and upper bounds for the total processing time (Q2043022) (← links)
- Starting time minimization for the maximum job variant (Q2057591) (← 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)
- New results on competitive analysis of online SRPT scheduling (Q2080035) (← links)
- Improved approximation algorithms for non-preemptive multiprocessor scheduling with testing (Q2168774) (← links)
- An optimal online algorithm for scheduling with general machine cost functions (Q2173052) (← 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)
- Online makespan minimization with parallel schedules (Q2362356) (← links)
- Separating online scheduling algorithms with the relative worst order ratio (Q2385472) (← links)
- On the value of job migration in online makespan minimization (Q2408930) (← links)
- Improved algorithm for a generalized on-line scheduling problem on identical machines (Q2432940) (← links)
- An efficient algorithm for bin stretching (Q2450663) (← links)
- Load balancing of temporary tasks in the \(\ell _{p}\) norm (Q2503355) (← links)
