Pages that link to "Item:Q336914"
From MaRDI portal
The following pages link to A better online algorithm for the parallel machine scheduling to minimize the total weighted completion time (Q336914):
Displaying 11 items.
- Online parallel-batch scheduling to minimize total weighted completion time on single unbounded machine (Q280944) (← links)
- Online scheduling with linear deteriorating jobs to minimize the total weighted completion time (Q668523) (← links)
- On-line scheduling of parallel machines to minimize total completion times (Q1010275) (← links)
- A new dynamic programming algorithm for the parallel machines total weighted completion time problem (Q1197881) (← 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)
- Online scheduling to minimize the total weighted completion time plus the rejection cost (Q2410099) (← 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 competitive online algorithm for minimizing total weighted completion time on uniform machines (Q6534502) (← links)