Pages that link to "Item:Q1806913"

The following pages link to Stochastically minimizing the makespan in two-machine flow shops without blocking (Q1806913):

Displaying 17 items.

• Two-machine stochastic flow shops with blocking and the traveling salesman problem (Q880520) (← links)
• A contribution to the stochastic flow shop scheduling problem. (Q1410626) (← links)
• On three-machine flow shops with random job processing times (Q1580990) (← links)
• Hybrid flow shop scheduling with sequence dependent family setup time and uncertain due dates (Q1630186) (← links)
• On the optimality conditions of the two-machine flow shop problem (Q1754105) (← links)
• Componentwise bounds for nearly completely decomposable Markov chains using stochastic comparison and reordering (Q1771369) (← links)
• Markovian analysis for performance evaluation and scheduling in \(m\) machine stochastic flow-shop with buffers of any capacity (Q1887781) (← links)
• Schedule execution for two-machine flow-shop with interval processing times (Q2390053) (← links)
• Uncertainty measure for the Bellman-Johnson problem with interval processing times (Q2452733) (← 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)
• Stochastically minimizing the makespan in flow shops (Q3220336) (← links)
• On Minimizing the Expected Makespan and Flow Time in Stochastic Flow Shops with Blocking (Q3745604) (← links)
• A Probabilistic Analysis of Two-Machine Flowshops (Q4346342) (← links)
• Generalization of Johnson's and Talwar's scheduling rules in two-machine stochastic flow shops (Q4678208) (← links)
• Two-machine flowshop minimum-length scheduling problem with random and bounded processing times (Q4806914) (← links)
• A simheuristic algorithm for the stochastic permutation flow‐shop problem with delivery dates and cumulative payoffs (Q6070118) (← links)