Pages that link to "Item:Q337133"

The following pages link to Single machine scheduling problem with interval processing times to minimize mean weighted completion time (Q337133):

Displaying 8 items.

• Total completion time with makespan constraint in no-wait flowshops with setup times (Q296867) (← links)
• The robust (minmax regret) single machine scheduling with interval processing times and total weighted completion time objective (Q342174) (← links)
• Optimality region for job permutation in single-machine scheduling with uncertain processing times (Q827990) (← links)
• Single machine scheduling problem with interval processing times and total completion time objective (Q2283853) (← links)
• Algorithms for minimizing the number of tardy jobs for reducing production cost with uncertain processing times (Q2290196) (← links)
• Algorithms to minimize total completion time in a two-machine flowshop problem with uncertain set-up times (Q6094376) (← links)
• Evaluation of the quantiles and superquantiles of the makespan in interval valued activity networks (Q6109311) (← links)
• Robust permutation flow shop total weighted completion time problem: solution and application to the oil and gas industry (Q6109315) (← links)