Pages that link to "Item:Q943794"

The following pages link to Complexity of single machine scheduling problems under scenario-based uncertainty (Q943794):

Displaying 34 items.

• Single machine scheduling problems with uncertain parameters and the OWA criterion (Q282249) (← links)
• Lawler's minmax cost algorithm: optimality conditions and uncertainty (Q309059) (← links)
• Min-max regret version of a scheduling problem with outsourcing decisions under processing time uncertainty (Q322893) (← 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 the number of late jobs on a single machine under due date uncertainty (Q657256) (← links)
• A robust two-machine flow-shop scheduling model with scenario-dependent processing times (Q782088) (← links)
• Online makespan minimization with budgeted uncertainty (Q832833) (← 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)
• Min-max and min-max regret versions of combinatorial optimization problems: A survey (Q1014933) (← links)
• Robustness in operational research and decision aiding: a multi-faceted issue (Q1044079) (← links)
• Distributionally robust single machine scheduling with the total tardiness criterion (Q1628037) (← links)
• Robust scheduling to minimize the weighted number of late jobs with interval due-date uncertainty (Q1652531) (← links)
• Distributionally robust single machine scheduling with risk aversion (Q1752194) (← links)
• Distributionally robust scheduling on parallel machines under moment uncertainty (Q1991203) (← links)
• Scheduling in multi-scenario environment with an agreeable condition on job processing times (Q2070719) (← links)
• Parameterized multi-scenario single-machine scheduling problems (Q2196612) (← links)
• Risk-averse single machine scheduling: complexity and approximation (Q2286434) (← links)
• Solution algorithms for minimizing the total tardiness with budgeted processing time uncertainty (Q2286919) (← links)
• Robust min-max regret scheduling to minimize the weighted number of late jobs with interval processing times (Q2288971) (← links)
• Lawler's minmax cost problem under uncertainty (Q2410026) (← links)
• Robust scheduling with budgeted uncertainty (Q2414457) (← links)
• Complexity results for common due date scheduling problems with interval data and minmax regret criterion (Q2422739) (← links)
• Robust Single Machine Scheduling Problem with Weighted Number of Late Jobs Criterion (Q2806942) (← links)
• JUST-IN-TIME SCHEDULING UNDER SCENARIO-BASED UNCERTAINTY (Q2836525) (← links)
• Towards a Robust Scheduling on Unrelated Parallel Machines: A Scenarios Based Approach (Q5357767) (← links)
• Approximation results for makespan minimization with budgeted uncertainty (Q5919095) (← links)
• Min–max version of single-machine scheduling with generalized due dates under scenario-based uncertainty (Q6094564) (← links)
• A two-stage robust approach for minimizing the weighted number of tardy jobs with objective uncertainty (Q6103748) (← links)
• Exact algorithms based on a constrained shortest path model for robust serial-batch and parallel-batch scheduling problems (Q6106966) (← links)
• A state-of-the-art survey on multi-scenario scheduling (Q6113303) (← links)
• Single machine robust scheduling with budgeted uncertainty (Q6161900) (← links)
• Total completion time scheduling under scenarios (Q6574934) (← links)