Pages that link to "Item:Q2572847"

The following pages link to A heuristic for minimizing the expected makespan in two-machine flow shops with consistent coefficients of variation (Q2572847):

Displaying 10 items.

• A mathematical programming approach to sample coefficient of variation with interval-valued observations (Q286182) (← links)
• On heuristic solutions for the stochastic flowshop scheduling problem (Q319784) (← links)
• Two-machine flowshop scheduling problem with bounded processing times to minimize total completion time (Q980257) (← links)
• Two-machine no-wait flowshop scheduling problem with uncertain setup times to minimize maximum lateness (Q1715728) (← links)
• A polynomial time heuristic for the two-machine flowshop scheduling problem with setup times and random processing times (Q1789013) (← links)
• Minimizing total completion time in a two-machine no-wait flowshop with uncertain and bounded setup times (Q2244222) (← links)
• Heuristic for stochastic online flowshop problem with preemption penalties (Q2312307) (← links)
• Heuristics for the two-machine flowshop scheduling problem to minimise makespan with bounded processing times (Q3163137) (← links)
• A simheuristic algorithm for the stochastic permutation flow‐shop problem with delivery dates and cumulative payoffs (Q6070118) (← links)
• Significantly improved dominance relation for no-wait flowshop scheduling problems with uncertain setup times (Q6157771) (← links)