Pages that link to "Item:Q702347"

The following pages link to On the robust single machine scheduling problem (Q702347):

Displaying 39 items.

• Single machine scheduling problems with uncertain parameters and the OWA criterion (Q282249) (← links)
• Min-max regret version of a scheduling problem with outsourcing decisions under processing time uncertainty (Q322893) (← links)
• The robust (minmax regret) single machine scheduling with interval processing times and total weighted completion time objective (Q342174) (← links)
• Approximating a two-machine flow shop scheduling under discrete scenario uncertainty (Q439320) (← links)
• Minimizing value-at-risk in single-machine scheduling (Q513548) (← links)
• Minimizing total weighted completion time with uncertain data: a stability approach (Q612208) (← links)
• A robust two-machine flow-shop scheduling model with scenario-dependent processing times (Q782088) (← links)
• Optimality region for job permutation in single-machine scheduling with uncertain processing times (Q827990) (← links)
• Investigating the recoverable robust single machine scheduling problem under interval uncertainty (Q833004) (← links)
• Algorithms and complexity analysis for robust single-machine scheduling problems (Q906553) (← links)
• Complexity of single machine scheduling problems under scenario-based uncertainty (Q943794) (← links)
• Minimizing total weighted flow time of a set of jobs with interval processing times (Q969917) (← links)
• Analytic evaluation of the expectation and variance of different performance measures of a schedule on a single machine under processing time variability (Q1029270) (← links)
• Distributionally robust single machine scheduling with the total tardiness criterion (Q1628037) (← links)
• Robust single machine scheduling with a flexible maintenance activity (Q1738814) (← links)
• Minimizing the weighted sum of completion times under processing time uncertainty (Q1742192) (← links)
• Distributionally robust single machine scheduling with risk aversion (Q1752194) (← links)
• Minimizing total weighted flow time under uncertainty using dominance and a stability box (Q1762112) (← links)
• Robust scheduling on a single machine to minimize total flow time (Q1762157) (← links)
• Distributionally robust scheduling on parallel machines under moment uncertainty (Q1991203) (← 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)
• A family of inequalities valid for the robust single machine scheduling polyhedron (Q2270446) (← links)
• An approximation scheme for the bi-scenario sum of completion times trade-off problem (Q2283294) (← links)
• Single machine scheduling problem with interval processing times and total completion time objective (Q2283853) (← links)
• Solution algorithms for minimizing the total tardiness with budgeted processing time uncertainty (Q2286919) (← links)
• Measures of problem uncertainty for scheduling with interval processing times (Q2393127) (← links)
• Robust scheduling with budgeted uncertainty (Q2414457) (← 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)
• Predictive-reactive scheduling on a single resource with uncertain future jobs (Q2482799) (← links)
• JUST-IN-TIME SCHEDULING UNDER SCENARIO-BASED UNCERTAINTY (Q2836525) (← links)
• Comparing deterministic, robust and online scheduling using entropy (Q4681156) (← links)
• Exact Algorithms for Distributionally <i>β</i>-Robust Machine Scheduling with Uncertain Processing Times (Q5137951) (← links)
• A two-stage robust approach for minimizing the weighted number of tardy jobs with objective uncertainty (Q6103748) (← links)
• Robust permutation flow shop total weighted completion time problem: solution and application to the oil and gas industry (Q6109315) (← links)
• A state-of-the-art survey on multi-scenario scheduling (Q6113303) (← links)