Pages that link to "Item:Q906553"

The following pages link to Algorithms and complexity analysis for robust single-machine scheduling problems (Q906553):

Displaying 29 items.

• Efficient implementation of Carathéodory's theorem for the single machine scheduling polytope (Q323058) (← links)
• On the robust single machine scheduling problem (Q702347) (← links)
• Efficient algorithms for robustness in resource allocation and scheduling problems (Q818137) (← links)
• Online makespan minimization with budgeted uncertainty (Q832833) (← links)
• Investigating the recoverable robust single machine scheduling problem under interval uncertainty (Q833004) (← links)
• A robust approach for the single machine scheduling problem (Q835547) (← links)
• Complexity of single machine scheduling problems under scenario-based uncertainty (Q943794) (← links)
• Distributionally robust single machine scheduling with the total tardiness criterion (Q1628037) (← links)
• Robust combinatorial optimization with knapsack uncertainty (Q1662111) (← links)
• Minimizing the weighted sum of completion times under processing time uncertainty (Q1742192) (← links)
• Distributionally robust single machine scheduling with risk aversion (Q1752194) (← links)
• Robust scheduling on a single machine to minimize total flow time (Q1762157) (← links)
• Single machine scheduling with scenarios (Q1945942) (← links)
• Distributionally robust scheduling on parallel machines under moment uncertainty (Q1991203) (← links)
• Robust two-stage combinatorial optimization problems under convex second-stage cost uncertainty (Q2125227) (← 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 scheduling with budgeted uncertainty (Q2414457) (← links)
• The complexity of machine scheduling for stability with a single disrupted job (Q2488217) (← links)
• A robust optimization approach for the unrelated parallel machine scheduling problem (Q2701168) (← links)
• (Q3607606) (← links)
• Robust Scheduling to Hedge Against Processing Time Uncertainty in Single-Stage Production (Q4849349) (← links)
• Constant-Ratio Approximation for Robust Bin Packing with Budgeted Uncertainty (Q5046625) (← links)
• Exact Algorithms for Distributionally <i>β</i>-Robust Machine Scheduling with Uncertain Processing Times (Q5137951) (← links)
• Approximation results for makespan minimization with budgeted uncertainty (Q5919095) (← links)
• Exact algorithms based on a constrained shortest path model for robust serial-batch and parallel-batch scheduling problems (Q6106966) (← links)
• Robust permutation flow shop total weighted completion time problem: solution and application to the oil and gas industry (Q6109315) (← links)
• Single machine robust scheduling with budgeted uncertainty (Q6161900) (← links)
• Combinatorial robust optimization with decision-dependent information discovery and polyhedral uncertainty (Q6633275) (← links)