Pages that link to "Item:Q2393127"

The following pages link to Measures of problem uncertainty for scheduling with interval processing times (Q2393127):

Displaying 13 items.

• Single machine scheduling problem with interval processing times to minimize mean weighted completion time (Q337133) (← links)
• Minimizing total weighted completion time with uncertain data: a stability approach (Q612208) (← links)
• Reexamination of processing time uncertainty (Q707112) (← 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)
• Minimizing total weighted flow time of a set of jobs with interval processing times (Q969917) (← links)
• Optimal makespan scheduling with given bounds of processing times (Q1381777) (← links)
• An efficient bicriteria algorithm for stable robotic flow shop scheduling (Q1753515) (← links)
• Minimizing total weighted flow time under uncertainty using dominance and a stability box (Q1762112) (← links)
• Optimal control algorithms and their analysis for short-term scheduling in manufacturing systems (Q2283836) (← links)
• Single machine scheduling problem with interval processing times and total completion time objective (Q2283853) (← links)
• Uncertainty measure for the Bellman-Johnson problem with interval processing times (Q2452733) (← links)
• On the operational definition of processing time uncertainty (Q4679982) (← links)