Pages that link to "Item:Q2563865"
From MaRDI portal
The following pages link to Determining the optimal sequences and the distributional properties of their completion times in stochastic flow shops (Q2563865):
Displaying 11 items.
- Stochastic bounds for order flow times in parts-to-picker warehouses with remotely located order-picking workstations (Q323430) (← links)
- The Browne-Yechiali single-machine sequence is optimal for flow-shops (Q976013) (← links)
- Analytic evaluation of the expectation and variance of different performance measures of a schedule on a single machine under processing time variability (Q1029270) (← links)
- A heuristic for minimizing the expected makespan in two-machine flow shops with consistent coefficients of variation (Q2572847) (← links)
- Johnson's problem with stochastic processing times and optimal service level (Q2572849) (← links)
- Exact solutions for the two-machine robust flow shop with budgeted uncertainty (Q2670559) (← links)
- The Asymptotic Optimality of the SPT Rule for the Flow Shop Mean Completion Time Problem (Q3635001) (← links)
- A simheuristic algorithm for the stochastic permutation flow‐shop problem with delivery dates and cumulative payoffs (Q6070118) (← links)
- Robust permutation flow shop total weighted completion time problem: solution and application to the oil and gas industry (Q6109315) (← links)
- Robust scheduling in a two-machine re-entrant flow shop to minimise the value-at-risk of the makespan: branch-and-bound and heuristic algorithms based on Markovian activity networks and phase-type distributions (Q6588502) (← links)
- Efficient solutions to the \(m\)-machine robust flow shop under budgeted uncertainty (Q6588503) (← links)
