The following pages link to (Q2948897):
Displaying 16 items.
- Online parallel-batch scheduling to minimize total weighted completion time on single unbounded machine (Q280944) (← links)
- A better online algorithm for the parallel machine scheduling to minimize the total weighted completion time (Q336914) (← links)
- Online scheduling to minimize maximum weighted flow-time on a bounded parallel-batch machine (Q829170) (← links)
- Online scheduling on \(m\) uniform machines to minimize total (weighted) completion time (Q837179) (← links)
- Online scheduling on bounded batch machines to minimize the maximum weighted completion time (Q1656199) (← links)
- An improved 2.11-competitive algorithm for online scheduling on parallel machines to minimize total weighted completion time (Q1716959) (← links)
- Single-machine online scheduling of jobs with non-delayed processing constraint (Q2045026) (← links)
- A 2-competitive largest job on least loaded machine online algorithm based on the multi list scheduling model (Q2079980) (← links)
- Single machine scheduling with rejection to minimize the weighted makespan (Q2151365) (← links)
- The asymptotic performance ratio of an on-line algorithm for uniform parallel machine scheduling with release dates (Q2490322) (← links)
- Online NDP-constraint scheduling of jobs with delivery times or weights (Q2693783) (← links)
- Best-Possible Online Algorithms for Single Machine Scheduling to Minimize the Maximum Weighted Completion Time (Q4561187) (← links)
- Online Parallel-Machine Scheduling in KRT Environment to Minimize Total Weighted Completion Time (Q4689382) (← links)
- Randomized approximation schemes for minimizing the weighted makespan on identical parallel machines (Q6126818) (← links)
- On the parameterized tractability of single machine scheduling with rejection to minimize the weighted makespan (Q6535285) (← links)
- Online single-processor scheduling with an unexpected breakdown (Q6561564) (← links)
