Pages that link to "Item:Q1762157"

The following pages link to Robust scheduling on a single machine to minimize total flow time (Q1762157):

Displaying 27 items.

• Robust optimization for the cyclic hoist scheduling problem (Q300031) (← links)
• The third comprehensive survey on scheduling problems with setup times/costs (Q319774) (← links)
• Robust vertex \(p\)-center model for locating urgent relief distribution centers (Q336453) (← links)
• The robust (minmax regret) single machine scheduling with interval processing times and total weighted completion time objective (Q342174) (← links)
• Minimizing value-at-risk in single-machine scheduling (Q513548) (← links)
• Optimality region for job permutation in single-machine scheduling with uncertain processing times (Q827990) (← links)
• Optimal control strategies for single-machine family scheduling with sequence-dependent batch setup and controllable processing times (Q892912) (← links)
• Algorithms and complexity analysis for robust single-machine scheduling problems (Q906553) (← links)
• Distributionally robust single machine scheduling with the total tardiness criterion (Q1628037) (← links)
• Robust minmax regret combinatorial optimization problems with a resource-dependent uncertainty polyhedron of scenarios (Q1634058) (← links)
• Robust single machine scheduling with a flexible maintenance activity (Q1738814) (← links)
• Distributionally robust single machine scheduling with risk aversion (Q1752194) (← links)
• Stochastic single machine scheduling problem as a multi-stage dynamic random decision process (Q2051165) (← links)
• Scheduling in multi-scenario environment with an agreeable condition on job processing times (Q2070719) (← links)
• Target-based distributionally robust optimization for single machine scheduling (Q2077908) (← links)
• Parameterized multi-scenario single-machine scheduling problems (Q2196612) (← links)
• Scheduling jobs with normally distributed processing times on parallel machines (Q2242242) (← 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)
• A MIP formulation for the minmax regret total completion time in scheduling with unrelated parallel machines (Q2448222) (← links)
• Robust single machine makespan scheduling with release date uncertainty (Q2661573) (← links)
• Distributionally robust scheduling algorithms for total flow time minimization on parallel machines using norm regularizations (Q2672063) (← links)
• A stochastic approach for the single-machine scheduling problem to minimize total expected cost with client-dependent tardiness costs (Q6048180) (← links)
• Exact algorithms based on a constrained shortest path model for robust serial-batch and parallel-batch scheduling problems (Q6106966) (← links)
• Single machine scheduling with release dates: a distributionally robust approach (Q6112405) (← links)
• A state-of-the-art survey on multi-scenario scheduling (Q6113303) (← links)
• Target-oriented robust satisficing models for the single machine scheduling problems with release time (Q6568456) (← links)