Pages that link to "Item:Q2641865"
From MaRDI portal
The following pages link to Approximating total flow time on parallel machines (Q2641865):
Displaying 14 items.
- Improved lower bounds for online scheduling to minimize total stretch (Q1680548) (← links)
- Scheduling parallel jobs online with convex and concave parallelizability (Q1743115) (← links)
- Energy efficient scheduling of parallelizable jobs (Q1743718) (← links)
- The consecutive multiprocessor job scheduling problem (Q2178063) (← links)
- Non-clairvoyantly scheduling to minimize convex functions (Q2319644) (← links)
- A unified heuristic and an annotated bibliography for a large class of earliness-tardiness scheduling problems (Q2327956) (← links)
- Rejecting jobs to minimize load and maximum flow-time (Q2409575) (← links)
- Improved multi-processor scheduling for flow time and energy (Q2434271) (← links)
- Scheduling jobs with release dates on identical parallel machines by minimizing the total weighted completion time (Q2664351) (← links)
- Distributionally robust scheduling algorithms for total flow time minimization on parallel machines using norm regularizations (Q2672063) (← links)
- From Preemptive to Non-preemptive Scheduling Using Rejections (Q2817893) (← links)
- Minimizing Average Flow Time on Unrelated Machines (Q3602830) (← links)
- Non-Preemptive Flow-Time Minimization via Rejections (Q5002748) (← links)
- An Optimal Control Framework for Online Job Scheduling with General Cost Functions (Q5058033) (← links)
