Pages that link to "Item:Q2490322"
From MaRDI portal
The following pages link to The asymptotic performance ratio of an on-line algorithm for uniform parallel machine scheduling with release dates (Q2490322):
Displaying 19 items.
- A better online algorithm for the parallel machine scheduling to minimize the total weighted completion time (Q336914) (← links)
- The expected asymptotical ratio for preemptive stochastic online problem (Q391147) (← links)
- Asymptotical optimality of WSEPT for stochastic online scheduling on uniform machines (Q763104) (← links)
- An optimal semi-online algorithm for a single machine scheduling problem with bounded processing time (Q991796) (← links)
- LP-based online scheduling: From single to parallel machines (Q1013970) (← links)
- Online scheduling problems with flexible release dates: applications to infrastructure restoration (Q1651574) (← links)
- An improved 2.11-competitive algorithm for online scheduling on parallel machines to minimize total weighted completion time (Q1716959) (← links)
- Randomized selection algorithm for online stochastic unrelated machines scheduling (Q2082193) (← links)
- An adversarial model for scheduling with testing (Q2211361) (← links)
- A \(2.28\)-competitive algorithm for online scheduling on identical machines (Q2514649) (← links)
- A semi-online algorithm and its competitive analysis for parallel-machine scheduling problem with rejection (Q2662527) (← links)
- Performance analysis of fixed assignment policies for stochastic online scheduling on uniform parallel machines (Q2664447) (← links)
- Almost sure asymptotic optimality for online routing and machine scheduling problems (Q3057128) (← links)
- (Q4537734) (← links)
- Randomized mechanism design for decentralized network scheduling (Q5135252) (← links)
- Asymptotic Performance Ratio of an Online Algorithm for the Single Machine Scheduling With Release Dates (Q5273759) (← links)
- Stochastic Online Scheduling Revisited (Q5505682) (← links)
- Dynamic scheduling with uncertain job types (Q6167855) (← links)
- A competitive online algorithm for minimizing total weighted completion time on uniform machines (Q6534502) (← links)