Pages that link to "Item:Q969917"
From MaRDI portal
The following pages link to Minimizing total weighted flow time of a set of jobs with interval processing times (Q969917):
Displayed 9 items.
- Single machine scheduling problem with interval processing times to minimize mean weighted completion time (Q337133) (← links)
- The robust (minmax regret) single machine scheduling with interval processing times and total weighted completion time objective (Q342174) (← links)
- Minimizing total weighted completion time with uncertain data: a stability approach (Q612208) (← links)
- Stability polyhedra of optimal permutation of jobs servicing (Q893928) (← links)
- Minimizing total weighted flow time under uncertainty using dominance and a stability box (Q1762112) (← links)
- Measures of problem uncertainty for scheduling with interval processing times (Q2393127) (← links)
- A MIP formulation for the minmax regret total completion time in scheduling with unrelated parallel machines (Q2448222) (← links)
- Uncertainty measure for the Bellman-Johnson problem with interval processing times (Q2452733) (← links)
- The dominance digraph as a solution to the two-machine flow-shop problem with interval processing times (Q3111147) (← links)