Pages that link to "Item:Q4849349"

The following pages link to Robust Scheduling to Hedge Against Processing Time Uncertainty in Single-Stage Production (Q4849349):

Displaying 50 items.

• Min-max regret version of a scheduling problem with outsourcing decisions under processing time uncertainty (Q322893) (← links)
• Scheduling under linear constraints (Q323163) (← links)
• Setting optimal due dates in a basic safe-scheduling model (Q336772) (← links)
• The robust (minmax regret) single machine scheduling with interval processing times and total weighted completion time objective (Q342174) (← links)
• Minimizing conditional-value-at-risk for stochastic scheduling problems (Q398891) (← links)
• Robust multi-market newsvendor models with interval demand data (Q421536) (← links)
• Approximating a two-machine flow shop scheduling under discrete scenario uncertainty (Q439320) (← links)
• On a constant factor approximation for minmax regret problems using a symmetry point scenario (Q439704) (← links)
• Minimizing value-at-risk in single-machine scheduling (Q513548) (← links)
• Scheduling with uncertainties on new computing platforms (Q535305) (← links)
• Minimizing total weighted completion time with uncertain data: a stability approach (Q612208) (← links)
• Reexamination of processing time uncertainty (Q707112) (← 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)
• Scheduling for stability in single-machine production systems (Q835553) (← links)
• Robust optimization models for project scheduling with resource availability cost (Q880580) (← links)
• Optimal control strategies for single-machine family scheduling with sequence-dependent batch setup and controllable processing times (Q892912) (← links)
• Stability polyhedra of optimal permutation of jobs servicing (Q893928) (← 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)
• A 2-approximation algorithm for interval data minmax regret sequencing problems with the total flow time criterion (Q943795) (← links)
• Minimizing total weighted flow time of a set of jobs with interval processing times (Q969917) (← links)
• A 2-approximation for minmax regret problems via a mid-point scenario optimal solution (Q991475) (← links)
• Min-max and min-max regret versions of combinatorial optimization problems: A survey (Q1014933) (← links)
• Computing and minimizing the relative regret in combinatorial optimization with interval data (Q1019293) (← 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)
• A fuzzy robust scheduling approach for product development projects. (Q1410333) (← links)
• Using real time information for effective dynamic scheduling (Q1604065) (← links)
• Distributionally robust single machine scheduling with the total tardiness criterion (Q1628037) (← links)
• Robust single machine scheduling with a flexible maintenance activity (Q1738814) (← 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)
• Project scheduling under uncertainty: survey and research potentials (Q1772834) (← links)
• A heuristic to minimax absolute regret for linear programs with interval objective function coefficients (Q1847156) (← links)
• Executing production schedules in the face of uncertainties: a review and some future directions (Q1887777) (← links)
• A robustness approach to international sourcing (Q1904678) (← links)
• Distributionally robust scheduling on parallel machines under moment uncertainty (Q1991203) (← links)
• A single-machine scheduling problem with uncertainty in processing times and outsourcing costs (Q1992893) (← links)
• Self-imposed time windows in vehicle routing problems (Q2018105) (← links)
• Stochastic single machine scheduling problem as a multi-stage dynamic random decision process (Q2051165) (← links)
• Optimally rescheduling jobs with a last-in-first-out buffer (Q2066687) (← 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)
• An adaptive robust optimization model for parallel machine scheduling (Q2106719) (← links)
• Parameterized multi-scenario single-machine scheduling problems (Q2196612) (← links)
• A survey of dynamic scheduling in manufacturing systems (Q2268515) (← links)
• A family of inequalities valid for the robust single machine scheduling polyhedron (Q2270446) (← links)
• Single machine scheduling problem with interval processing times and total completion time objective (Q2283853) (← links)