A 2-approximation algorithm for interval data minmax regret sequencing problems with the total flow time criterion

Authors:
Adam Kasperski;Paweł ZielińSki
Affiliations:
Institute of Industrial Engineering and Management, Wrocław University of Technology, Wybrzee Wyspiańskiego 27, 50-370 Wrocław, Poland;Institute of Mathematics and Computer Science, Wrocław University of Technology, Wybrzee Wyspiańskiego 27, 50-370 Wrocław, Poland
Venue:
Operations Research Letters
Year:
2008

Citing 4
Cited 5

Robust scheduling to hedge against processing time uncertainty in single-stage production

Management Science
Scheduling Algorithms

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

Discrete Applied Mathematics - Special issue: International symposium on combinatorial optimization CO'02
An approximation algorithm for interval data minmax regret combinatorial optimization problems

Information Processing Letters

Minimizing total weighted completion time with uncertain data: A stability approach

Automation and Remote Control
Minimizing total weighted flow time under uncertainty using dominance and a stability box

Computers and Operations Research
A robust critical path in an environment with hybrid uncertainty

Applied Soft Computing
A 2-approximation for minmax regret problems via a mid-point scenario optimal solution

Operations Research Letters
Measures of problem uncertainty for scheduling with interval processing times

OR Spectrum

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we discuss a minmax regret version of the single-machine scheduling problem with the total flow time criterion. Uncertain processing times are modeled by closed intervals. We show that if the deterministic problem is polynomially solvable, then its minmax regret version is approximable within 2.