Pages that link to "Item:Q1716959"
From MaRDI portal
The following pages link to An improved 2.11-competitive algorithm for online scheduling on parallel machines to minimize total weighted completion time (Q1716959):
Displaying 12 items.
- A better online algorithm for the parallel machine scheduling to minimize the total weighted completion time (Q336914) (← links)
- Comments on ``Competitive analysis of a better on-line algorithm to minimize total completion time on a single-machine'' (Q625659) (← links)
- Improved competitive algorithms for online scheduling with partial job values (Q1884846) (← links)
- An optimal online algorithm for single-processor scheduling problem with learning effect (Q2079858) (← links)
- A 2-competitive largest job on least loaded machine online algorithm based on the multi list scheduling model (Q2079980) (← links)
- Randomized selection algorithm for online stochastic unrelated machines scheduling (Q2082193) (← links)
- A best possible algorithm for an online scheduling problem with position-based learning effect (Q2171076) (← links)
- A \(2.28\)-competitive algorithm for online scheduling on identical machines (Q2514649) (← links)
- (Q2948897) (← links)
- Online Parallel-Machine Scheduling in KRT Environment to Minimize Total Weighted Completion Time (Q4689382) (← links)
- A Semi-Online Algorithm for Single Machine Scheduling with Rejection (Q5024475) (← links)
- A competitive online algorithm for minimizing total weighted completion time on uniform machines (Q6534502) (← links)
