Pages that link to "Item:Q1887954"
From MaRDI portal
The following pages link to Mean flow time minimization with given bounds of processing times (Q1887954):
Displaying 12 items.
- Reliability analysis in presence of random variables and fuzzy variables (Q305453) (← links)
- An artificial bee colony algorithm for the job shop scheduling problem with random processing times (Q400942) (← links)
- Minimizing total weighted completion time with uncertain data: a stability approach (Q612208) (← links)
- Group shops scheduling with makespan criterion subject to random release dates and processing times (Q733535) (← links)
- Stability polyhedra of optimal permutation of jobs servicing (Q893928) (← links)
- The stability radius of an optimal line balance with maximum efficiency for a simple assembly line (Q1634287) (← links)
- Minimizing total weighted flow time under uncertainty using dominance and a stability box (Q1762112) (← links)
- Schedule execution for two-machine flow-shop with interval processing times (Q2390053) (← 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)
- TWO-MACHINE FLOW-SHOP MINIMUM-LENGTH SCHEDULING WITH INTERVAL PROCESSING TIMES (Q3406723) (← links)
