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

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

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.

Adam Kasperski | Pawel Zielinski | P. Zieliński | A. Kasperski

[1] Igor Averbakh,et al. Complexity of minimizing the total flow time with interval data and minmax regret criterion , 2006, Discret. Appl. Math..

[2] A Gerodimos,et al. Robust Discrete Optimization and its Applications , 1996, J. Oper. Res. Soc..

[3] E. Lawler. Sequencing Jobs to Minimize Total Weighted Completion Time Subject to Precedence Constraints , 1978 .

[4] Wayne E. Smith. Various optimizers for single‐stage production , 1956 .

[5] Jan Karel Lenstra,et al. Complexity of Scheduling under Precedence Constraints , 1978, Oper. Res..

[6] Roberto Montemanni,et al. A Mixed Integer Programming Formulation for the Total Flow Time Single Machine Robust Scheduling Problem with Interval Data , 2007, J. Math. Model. Algorithms.

[7] D. Atkin. OR scheduling algorithms. , 2000, Anesthesiology.

[8] Adam Kasperski,et al. An approximation algorithm for interval data minmax regret combinatorial optimization problems , 2006, Inf. Process. Lett..

[9] Panagiotis Kouvelis,et al. Robust scheduling to hedge against processing time uncertainty in single-stage production , 1995 .