Pages that link to "Item:Q2488241"

The following pages link to Minimizing maximal regret in the single machine sequencing problem with maximum lateness criterion (Q2488241):

Displaying 21 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)
• Scheduling under linear constraints (Q323163) (← links)
• Approximating a two-machine flow shop scheduling under discrete scenario uncertainty (Q439320) (← links)
• Minimizing value-at-risk in single-machine scheduling (Q513548) (← links)
• Scheduling with uncertainties on new computing platforms (Q535305) (← 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)
• Min-max and min-max regret versions of combinatorial optimization problems: A survey (Q1014933) (← links)
• Improved polynomial algorithms for robust bottleneck problems with interval data (Q1046706) (← 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)
• 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)
• Minimizing maximum cost for a single machine under uncertainty of processing times (Q2184134) (← links)
• Risk-averse single machine scheduling: complexity and approximation (Q2286434) (← links)
• Measures of problem uncertainty for scheduling with interval processing times (Q2393127) (← links)
• Lawler's minmax cost problem under uncertainty (Q2410026) (← links)
• Exact algorithms based on a constrained shortest path model for robust serial-batch and parallel-batch scheduling problems (Q6106966) (← links)