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

Authors:
Yu. N. Sotskov;N. G. Egorova;F. Werner
Affiliations:
United Institute of Informatics Problems, Belarussian National Academy of Sciences, Minsk, Belarus;United Institute of Informatics Problems, Belarussian National Academy of Sciences, Minsk, Belarus;Otto-von-Guericke-University, Magdeburg, Germany
Venue:
Automation and Remote Control
Year:
2010

Citing 8
Cited 0

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

Management Science
Stability in the Combinatorial Vector Optimization Problems

Automation and Remote Control
Scheduling: Theory, Algorithms, and Systems

Scheduling: Theory, Algorithms, and Systems
Minimizing total weighted flow time under uncertainty using dominance and a stability box

Computers and Operations Research
Schedule execution for two-machine flow-shop with interval processing times

Mathematical and Computer Modelling: An International Journal
Minimizing total weighted flow time of a set of jobs with interval processing times

Mathematical and Computer Modelling: An International Journal
Optimal makespan scheduling with given bounds of processing times

Mathematical and Computer Modelling: An International Journal
A 2-approximation algorithm for interval data minmax regret sequencing problems with the total flow time criterion

Operations Research Letters

Quantified Score

Hi-index	0.00

Visualization

Abstract

A single-machine scheduling problem is investigated provided that the input data are uncertain: The processing time of a job can take any real value from the given segment. The criterion is to minimize the total weighted completion time for the n jobs. As a solution concept to such a scheduling problem with an uncertain input data, it is reasonable to consider a minimal dominant set of job permutations containing an optimal permutation for each possible realization of the job processing times. To find an optimal or approximate permutation to be realized, we look for a permutation with the largest stability box being a subset of the stability region. We develop a branch-and-bound algorithm to construct a permutation with the largest volume of a stability box. If several permutations have the same volume of a stability box, we select one of them due to one of two simple heuristics. The efficiency of the constructed permutations (how close they are to a factually optimal permutation) and the efficiency of the developed software (average CPU-time used for an instance) are demonstrated on a wide set of randomly generated instances with 5 驴 n 驴 100.