Complexity of minimizing the total flow time with interval data and minmax regret criterion
From MaRDI portal
Publication:2433804
Recommendations
- A 2-approximation algorithm for interval data minmax regret sequencing problems with the total flow time criterion
- An approximation algorithm for interval data minmax regret combinatorial optimization problems
- Interval data minmax regret network optimization problems
- Algorithms for the minmax regret path problem with interval data
- Pinpointing the complexity of the interval min-max regret knapsack problem
- Complexity of interval minmax regret scheduling on parallel identical machines with total completion time criterion
- Complexity of the min-max and min-max regret assignment problems
- Solution algorithms for unrelated machines minmax regret scheduling problem with interval processing times and the total flow time criterion
- Complexity of the min-max (regret) versions of min cut problems
- Some tractable instances of interval data minmax regret problems
Cites work
- scientific article; zbMATH DE number 1634827 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- On the complexity of a class of combinatorial optimization problems with uncertainty
- Robust discrete optimization and its applications
- Robust Optimization of Large-Scale Systems
- Robust Scheduling to Hedge Against Processing Time Uncertainty in Single-Stage Production
- Sensitivity analysis for scheduling problems
- Sensitivity analysis of scheduling algorithms
Cited in
(41)- Min-max and min-max regret versions of combinatorial optimization problems: A survey
- Computing and minimizing the relative regret in combinatorial optimization with interval data
- Robust placement of sensors in dynamic water distribution systems
- Improved polynomial algorithms for robust bottleneck problems with interval data
- Distributionally robust single machine scheduling with the total tardiness criterion
- Robust minmax regret combinatorial optimization problems with a resource-dependent uncertainty polyhedron of scenarios
- Minmax regret combinatorial optimization problems with investments
- Robust scheduling to minimize the weighted number of late jobs with interval due-date uncertainty
- Robust single machine scheduling with a flexible maintenance activity
- Distributionally robust single machine scheduling with risk aversion
- Robust optimization analysis for multiple attribute decision making problems with imprecise information
- Minimizing total weighted flow time under uncertainty using dominance and a stability box
- Complexity of interval minmax regret scheduling on parallel identical machines with total completion time criterion
- A single-machine scheduling problem with uncertainty in processing times and outsourcing costs
- On the complexity of constructing a minmax regret solution for the two-machine flow shop problem under the interval uncertainty
- Risk-averse single machine scheduling: complexity and approximation
- Robust min-max regret scheduling to minimize the weighted number of late jobs with interval processing times
- Schedule execution for two-machine flow-shop with interval processing times
- Complexity results for common due date scheduling problems with interval data and minmax regret criterion
- A MIP formulation for the minmax regret total completion time in scheduling with unrelated parallel machines
- The minmax regret permutation flow-shop problem with two jobs
- Distributionally robust scheduling algorithms for total flow time minimization on parallel machines using norm regularizations
- Single machine scheduling problems with uncertain parameters and the OWA criterion
- On solving maximum and quickest interval-valued flows over time
- Min-max regret version of a scheduling problem with outsourcing decisions under processing time uncertainty
- The robust (minmax regret) single machine scheduling with interval processing times and total weighted completion time objective
- Approximating a two-machine flow shop scheduling under discrete scenario uncertainty
- On a constant factor approximation for minmax regret problems using a symmetry point scenario
- Solution algorithms for unrelated machines minmax regret scheduling problem with interval processing times and the total flow time criterion
- Scheduling with uncertainties on new computing platforms
- Exact algorithms based on a constrained shortest path model for robust serial-batch and parallel-batch scheduling problems
- Min-max relative regret for scheduling to minimize maximum lateness
- Fix-and-optimize metaheuristics for minmax regret binary integer programming problems under interval uncertainty
- Fifty years of research in scheduling -- theory and applications
- Reactive scheduling of uncertain jobs with maximum time lags
- Min-max relative regret for scheduling to minimize maximum lateness
- Recoverable robust single machine scheduling with polyhedral uncertainty
- Investigating the recoverable robust single machine scheduling problem under interval uncertainty
- Algorithms and complexity analysis for robust single-machine scheduling problems
- A 2-approximation algorithm for interval data minmax regret sequencing problems with the total flow time criterion
- Minimizing total weighted flow time of a set of jobs with interval processing times
This page was built for publication: Complexity of minimizing the total flow time with interval data and minmax regret criterion
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2433804)
