Pages that link to "Item:Q1111928"
From MaRDI portal
The following pages link to Job scheduling to minimize expected weighted flowtime on uniform processors (Q1111928):
Displaying 14 items.
- Minimizing mean weighted execution time loss on identical and uniform processors (Q581214) (← links)
- Scheduling semi-malleable jobs to minimize mean flow time (Q892832) (← links)
- Minimizing expected makespans of multi-priority classes of jobs on uniform processors (Q1180830) (← links)
- Analysis of computer job control under uncertainty (Q2263387) (← links)
- Stochastic scheduling on parallel machines to minimize discounted holding costs (Q2268513) (← links)
- The expected competitive ratio for weighted completion time scheduling (Q2432529) (← links)
- Scheduling jobs on heterogeneous processors (Q2638924) (← links)
- Managing Queues with Heterogeneous Servers (Q3014984) (← links)
- Stochastically Minimizing Total Delay of Jobs Subject to Random Deadlines (Q3416017) (← links)
- SCHEDULING IMPATIENT JOBS IN A CLEARING SYSTEM WITH INSIGHTS ON PATIENT TRIAGE IN MASS CASUALTY INCIDENTS (Q3521206) (← links)
- Fast Scheduling of Weighted Unit Jobs with Release Times and Deadlines (Q3521921) (← links)
- Scheduling jobs on non-identical IFR processors to minimize general cost functions (Q3981883) (← links)
- A Bayesian Sequential Single Machine Scheduling Problem to Minimize the Expected Weighted Sum of Flowtimes of Jobs with Exponential Processing Times (Q4286471) (← links)
- How Unsplittable-Flow-Covering Helps Scheduling with Job-Dependent Cost Functions (Q5167778) (← links)
