Pages that link to "Item:Q703266"
From MaRDI portal
The following pages link to On-line scheduling to minimize average completion time revisited. (Q703266):
Displaying 21 items.
- A better online algorithm for the parallel machine scheduling to minimize the total weighted completion time (Q336914) (← links)
- Online scheduling on \(m\) uniform machines to minimize total (weighted) completion time (Q837179) (← links)
- On-line scheduling of parallel machines to minimize total completion times (Q1010275) (← links)
- LP-based online scheduling: From single to parallel machines (Q1013970) (← links)
- Online scheduling to minimize modified total tardiness with an availability constraint (Q1034623) (← 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)
- Stochastic optimization for real time service capacity allocation under random service demand (Q1931638) (← links)
- Randomized selection algorithm for online stochastic unrelated machines scheduling (Q2082193) (← links)
- Scheduling of tasks with effectiveness precedence constraints (Q2300636) (← links)
- A web-based ERP system for business services and supply chain management: Application to real-world process scheduling (Q2467279) (← links)
- A \(2.28\)-competitive algorithm for online scheduling on identical machines (Q2514649) (← links)
- An improved greedy algorithm for stochastic online scheduling on unrelated machines (Q2688463) (← links)
- Online Non-preemptive Scheduling to Optimize Max Stretch on a Single Machine (Q2817891) (← links)
- Online Appointment Scheduling in the Random Order Model (Q3452831) (← links)
- Online Parallel-Machine Scheduling in KRT Environment to Minimize Total Weighted Completion Time (Q4689382) (← links)
- (Q5009585) (← links)
- Greed Works—Online Algorithms for Unrelated Machine Stochastic Scheduling (Q5119844) (← links)
- A Tight 2-Approximation for Preemptive Stochastic Scheduling (Q5247621) (← links)
- Coping with Incomplete Information in Scheduling — Stochastic and Online Models (Q5391870) (← links)
- Stochastic Online Scheduling Revisited (Q5505682) (← links)
