Pages that link to "Item:Q1368686"
From MaRDI portal
The following pages link to Minimization of mean flow time for some discrete-continuous scheduling problems (Q1368686):
Displaying 8 items.
- Scheduling chains to minimize mean flow time (Q290213) (← links)
- Minimizing total flow time and total completion time with immediate dispatching (Q878441) (← links)
- Resource level minimization in the discrete-continuous scheduling (Q1043331) (← links)
- Equivalence of mean flow time problems and mean absolute deviation problems (Q1173904) (← links)
- Discrete-continuous scheduling problems -- mean completion time results (Q1278310) (← links)
- Stability of a schedule minimizing mean flow time (Q1362250) (← links)
- Worst Case Bound of an LRF Schedule for the Mean Weighted Flow-Time Problem (Q3757393) (← links)
- Minimizing Mean Completion Time for Special Flowshop Problems (Q4341060) (← links)