Pages that link to "Item:Q969917"

The following pages link to Minimizing total weighted flow time of a set of jobs with interval processing times (Q969917):

Displaying 18 items.

• Single machine scheduling problem with interval processing times to minimize mean weighted completion time (Q337133) (← links)
• The robust (minmax regret) single machine scheduling with interval processing times and total weighted completion time objective (Q342174) (← links)
• Minimizing total weighted completion time with uncertain data: a stability approach (Q612208) (← links)
• Optimality region for job permutation in single-machine scheduling with uncertain processing times (Q827990) (← links)
• Stability polyhedra of optimal permutation of jobs servicing (Q893928) (← links)
• Robust scheduling to minimize the weighted number of late jobs with interval due-date uncertainty (Q1652531) (← links)
• Two-machine no-wait flowshop scheduling problem with uncertain setup times to minimize maximum lateness (Q1715728) (← links)
• Minimizing total weighted flow time under uncertainty using dominance and a stability box (Q1762112) (← links)
• A polynomial time heuristic for the two-machine flowshop scheduling problem with setup times and random processing times (Q1789013) (← links)
• A better dominance relation and heuristics for two-machine no-wait flowshops with maximum lateness performance measure (Q1983744) (← links)
• Minimizing total completion time in a two-machine no-wait flowshop with uncertain and bounded setup times (Q2244222) (← links)
• Single machine scheduling problem with interval processing times and total completion time objective (Q2283853) (← links)
• Robust min-max regret scheduling to minimize the weighted number of late jobs with interval processing times (Q2288971) (← links)
• Algorithms for minimizing the number of tardy jobs for reducing production cost with uncertain processing times (Q2290196) (← links)
• Measures of problem uncertainty for scheduling with interval processing times (Q2393127) (← 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)