Pages that link to "Item:Q878441"
From MaRDI portal
The following pages link to Minimizing total flow time and total completion time with immediate dispatching (Q878441):
Displaying 13 items.
- Improved results for scheduling batched parallel jobs by using a generalized analysis framework (Q666034) (← links)
- SRPT applied to bandwidth-sharing networks (Q839852) (← links)
- Non-clairvoyantly scheduling to minimize convex functions (Q2319644) (← links)
- Rejecting jobs to minimize load and maximum flow-time (Q2409575) (← links)
- Improved multi-processor scheduling for flow time and energy (Q2434271) (← links)
- New resource augmentation analysis of the total stretch of srpt and SJF in multiprocessor scheduling (Q2503312) (← links)
- Approximating total flow time on parallel machines (Q2641865) (← links)
- An improved greedy algorithm for stochastic online scheduling on unrelated machines (Q2688463) (← links)
- Sleep Management on Multiple Machines for Energy and Flow Time (Q3012808) (← links)
- Minimizing Average Flow-Time (Q3644722) (← links)
- (Q5009506) (← links)
- Greed Works—Online Algorithms for Unrelated Machine Stochastic Scheduling (Q5119844) (← links)
- (Q5743472) (← links)
