Pages that link to "Item:Q2414457"

The following pages link to Robust scheduling with budgeted uncertainty (Q2414457):

Displaying 33 items.

• A robust basic cyclic scheduling problem (Q668955) (← links)
• On the robust single machine scheduling problem (Q702347) (← links)
• Robust allocation of operating rooms: a cutting plane approach to handle lognormal case durations (Q724114) (← 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)
• Scheduling with uncertain durations: Modeling \(\beta \)-robust scheduling with constraints (Q1010287) (← links)
• A perfect information lower bound for robust lot-sizing problems (Q1730584) (← links)
• Minimizing the weighted sum of completion times under processing time uncertainty (Q1742192) (← links)
• Single machine scheduling with scenarios (Q1945942) (← links)
• Exact lexicographic scheduling and approximate rescheduling (Q2029366) (← links)
• Approximate and robust bounded job start scheduling for Royal Mail delivery offices (Q2061143) (← links)
• Robust two-stage location allocation for emergency temporary blood supply in postdisaster (Q2073583) (← links)
• An adaptive robust optimization model for parallel machine scheduling (Q2106719) (← links)
• Branch-and-price approach for robust parallel machine scheduling with sequence-dependent setup times (Q2140270) (← links)
• Stability factor for robust balancing of simple assembly lines under uncertainty (Q2146745) (← links)
• Robust combinatorial optimization with locally budgeted uncertainty (Q2165591) (← links)
• Dominance-based linear formulation for the anchor-robust project scheduling problem (Q2239841) (← links)
• Solution algorithms for minimizing the total tardiness with budgeted processing time uncertainty (Q2286919) (← links)
• Robust single machine makespan scheduling with release date uncertainty (Q2661573) (← links)
• The distributionally robust machine scheduling problem with job selection and sequence-dependent setup times (Q2664350) (← links)
• Exact solutions for the two-machine robust flow shop with budgeted uncertainty (Q2670559) (← links)
• A robust optimization approach for the unrelated parallel machine scheduling problem (Q2701168) (← links)
• Scheduling When You Do Not Know the Number of Machines (Q4973057) (← links)
• (Q4986062) (← links)
• Constant-Ratio Approximation for Robust Bin Packing with Budgeted Uncertainty (Q5046625) (← links)
• Parallel Machine Scheduling Under Uncertainty: Models and Exact Algorithms (Q5060784) (← links)
• Approximation results for makespan minimization with budgeted uncertainty (Q5919095) (← links)
• Approximation algorithms for cost-robust discrete minimization problems based on their LP-relaxations (Q5970783) (← 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 single representative min-max-min robust selection problem with alternatives and budgeted uncertainty (Q6130218) (← links)
• Single machine robust scheduling with budgeted uncertainty (Q6161900) (← links)