The following pages link to (Q4828982):
Displaying 23 items.
- A better online algorithm for the parallel machine scheduling to minimize the total weighted completion time (Q336914) (← links)
- An optimal online algorithm for single machine scheduling to minimize total general completion time (Q421265) (← links)
- Competitive analysis of preemptive single-machine scheduling (Q614049) (← links)
- On-line scheduling to minimize average completion time revisited. (Q703266) (← links)
- Online scheduling on \(m\) uniform machines to minimize total (weighted) completion time (Q837179) (← links)
- Job scheduling methods for reducing waiting time variance (Q878584) (← links)
- On-line scheduling on a single machine: Minimizing the total completion time (Q1306569) (← links)
- Ordinal on-line scheduling for maximizing the minimum machine completion time (Q1598882) (← links)
- The power of \(\alpha\)-points in preemptive single machine scheduling. (Q1600001) (← links)
- An improved 2.11-competitive algorithm for online scheduling on parallel machines to minimize total weighted completion time (Q1716959) (← links)
- A class of on-line scheduling algorithms to minimize total completion time (Q1811633) (← links)
- Lower bounds for on-line single-machine scheduling. (Q1874403) (← links)
- Combinatorial algorithms for minimizing the weighted sum of completion times on a single machine (Q1949673) (← links)
- Online scheduling to minimize total weighted (modified) earliness and tardiness cost (Q2059092) (← links)
- Online heuristic for the preemptive single machine scheduling problem of minimizing the total weighted completion time (Q2926062) (← links)
- Online Scheduling with Known Arrival Times (Q3169021) (← links)
- On the Asymptotic Optimality of a Simple On-Line Algorithm for the Stochastic Single-Machine Weighted Completion Time Problem and Its Extensions (Q3391992) (← links)
- (Q4411418) (← links)
- Best-Possible Online Algorithms for Single Machine Scheduling to Minimize the Maximum Weighted Completion Time (Q4561187) (← links)
- Machine Scheduling to Minimize Weighted Completion Times (Q4636336) (← links)
- On the asymptotic optimality of algorithms for the flow shop problem with release dates (Q4680463) (← links)
- Approximation and Online Algorithms (Q5896935) (← links)
- Select and permute: an improved online framework for scheduling to minimize weighted completion time (Q5919414) (← links)
