Complexity of minimizing the total flow time with interval data and minmax regret criterion

DOI10.1016/j.dam.2005.04.015zbMath1111.90043OpenAlexW2091867238MaRDI QIDQ2433804

Publication date: 30 October 2006

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2005.04.015

zbMATH Keywords

complexity uncertainty minmax regret robust scheduling

Mathematics Subject Classification ID

Minimax problems in mathematical programming (90C47) Deterministic scheduling theory in operations research (90B35)

Related Items (34)

Single machine scheduling problems with uncertain parameters and the OWA criterion ⋮ Investigating the recoverable robust single machine scheduling problem under interval uncertainty ⋮ Distributionally robust single machine scheduling with the total tardiness criterion ⋮ Robust minmax regret combinatorial optimization problems with a resource-dependent uncertainty polyhedron of scenarios ⋮ Min-max regret version of a scheduling problem with outsourcing decisions under processing time uncertainty ⋮ Schedule execution for two-machine flow-shop with interval processing times ⋮ Minmax regret combinatorial optimization problems with investments ⋮ Robust scheduling to minimize the weighted number of late jobs with interval due-date uncertainty ⋮ The robust (minmax regret) single machine scheduling with interval processing times and total weighted completion time objective ⋮ Complexity results for common due date scheduling problems with interval data and minmax regret criterion ⋮ 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 ⋮ Algorithms and complexity analysis for robust single-machine scheduling problems ⋮ 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 ⋮ A MIP formulation for the minmax regret total completion time in scheduling with unrelated parallel machines ⋮ Solution algorithms for unrelated machines minmax regret scheduling problem with interval processing times and the total flow time criterion ⋮ Robust single machine scheduling with a flexible maintenance activity ⋮ A 2-approximation algorithm for interval data minmax regret sequencing problems with the total flow time criterion ⋮ A single-machine scheduling problem with uncertainty in processing times and outsourcing costs ⋮ Distributionally robust single machine scheduling with risk aversion ⋮ Scheduling with uncertainties on new computing platforms ⋮ 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 ⋮ Minimizing total weighted flow time of a set of jobs with interval processing times ⋮ Complexity of interval minmax regret scheduling on parallel identical machines with total completion time criterion ⋮ 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 ⋮ 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 ⋮ The minmax regret permutation flow-shop problem with two jobs

Cites Work

This page was built for publication: Complexity of minimizing the total flow time with interval data and minmax regret criterion