Pages that link to "Item:Q290213"
From MaRDI portal
The following pages link to Scheduling chains to minimize mean flow time (Q290213):
Displaying 14 items.
- Single-machine scheduling with precedence constraints and position-dependent processing times (Q350351) (← links)
- `Strong'-`weak' precedence in scheduling: extensions to series-parallel orders (Q602755) (← links)
- Minimizing total flow time and total completion time with immediate dispatching (Q878441) (← links)
- Scheduling semi-malleable jobs to minimize mean flow time (Q892832) (← links)
- Scheduling of parallel machines to minimize total completion time subject to s-precedence constraints (Q955602) (← links)
- Linear and quadratic algorithms for scheduling chains and opposite chains (Q1600834) (← links)
- Tree precedence in scheduling: The strong-weak distinction (Q1606979) (← links)
- Minimizing the maximum flow time in batch scheduling (Q1709967) (← links)
- Scheduling chain-structured tasks to minimize makespan and mean flow time (Q1814098) (← links)
- A review of four decades of time-dependent scheduling: main results, new topics, and open problems (Q2305016) (← links)
- Single-machine scheduling problems with precedence constraints and simple linear deterioration (Q2337543) (← links)
- Minimizing Mean Flow Time With Release Time and Deadline Constraints (Q4033756) (← links)
- REAL-TIME DISPATCHING: SCHEDULING STABILITY AND PRECEDENCE (Q5249007) (← links)
- Inequality-sum: a global constraint capturing the objective function (Q5479856) (← links)
