Pages that link to "Item:Q2433804"

The following pages link to Complexity of minimizing the total flow time with interval data and minmax regret criterion (Q2433804):

Displaying 33 items.

• Single machine scheduling problems with uncertain parameters and the OWA criterion (Q282249) (← links)
• Min-max regret version of a scheduling problem with outsourcing decisions under processing time uncertainty (Q322893) (← links)
• The robust (minmax regret) single machine scheduling with interval processing times and total weighted completion time objective (Q342174) (← 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)
• Solution algorithms for unrelated machines minmax regret scheduling problem with interval processing times and the total flow time criterion (Q490241) (← links)
• Scheduling with uncertainties on new computing platforms (Q535305) (← 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)
• 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)
• 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)
• Robust placement of sensors in dynamic water distribution systems (Q1040992) (← 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 minmax regret combinatorial optimization problems with a resource-dependent uncertainty polyhedron of scenarios (Q1634058) (← links)
• Minmax regret combinatorial optimization problems with investments (Q1652341) (← links)
• Robust scheduling to minimize the weighted number of late jobs with interval due-date uncertainty (Q1652531) (← links)
• Robust single machine scheduling with a flexible maintenance activity (Q1738814) (← links)
• Distributionally robust single machine scheduling with risk aversion (Q1752194) (← links)
• Robust optimization analysis for multiple attribute decision making problems with imprecise information (Q1761928) (← links)
• Minimizing total weighted flow time under uncertainty using dominance and a stability box (Q1762112) (← links)
• Complexity of interval minmax regret scheduling on parallel identical machines with total completion time criterion (Q1790193) (← links)
• A single-machine scheduling problem with uncertainty in processing times and outsourcing costs (Q1992893) (← links)
• Risk-averse single machine scheduling: complexity and approximation (Q2286434) (← links)
• Robust min-max regret scheduling to minimize the weighted number of late jobs with interval processing times (Q2288971) (← links)
• Schedule execution for two-machine flow-shop with interval processing times (Q2390053) (← links)
• Complexity results for common due date scheduling problems with interval data and minmax regret criterion (Q2422739) (← links)
• A MIP formulation for the minmax regret total completion time in scheduling with unrelated parallel machines (Q2448222) (← links)
• The minmax regret permutation flow-shop problem with two jobs (Q2572850) (← links)
• Exact algorithms based on a constrained shortest path model for robust serial-batch and parallel-batch scheduling problems (Q6106966) (← links)
• Fix-and-optimize metaheuristics for minmax regret binary integer programming problems under interval uncertainty (Q6186579) (← links)