Pages that link to "Item:Q4561187"
From MaRDI portal
The following pages link to Best-Possible Online Algorithms for Single Machine Scheduling to Minimize the Maximum Weighted Completion Time (Q4561187):
Displaying 13 items.
- A better online algorithm for the parallel machine scheduling to minimize the total weighted completion time (Q336914) (← links)
- Competitive analysis of preemptive single-machine scheduling (Q614049) (← links)
- An optimal online algorithm for single machine scheduling with bounded delivery times (Q1038322) (← links)
- Combinatorial algorithms for minimizing the weighted sum of completion times on a single machine (Q1949673) (← links)
- Single-machine online scheduling of jobs with non-delayed processing constraint (Q2045026) (← links)
- Single machine scheduling with rejection to minimize the weighted makespan (Q2151365) (← links)
- Online NDP-constraint scheduling of jobs with delivery times or weights (Q2693783) (← links)
- (Q2948897) (← 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)
- (Q4828982) (← 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)
