Measures of problem uncertainty for scheduling with interval processing times

Authors:
Yuri N. Sotskov;Tsung-Chyan Lai;Frank Werner
Affiliations:
United Institute of Informatics Problems, National Academy of Sciences of Belarus, Minsk, Belarus 220012;Department of Business Administration, National Taiwan University, Taipei, Taiwan 10672;Faculty of Mathematics, Otto-von-Guericke-University, Magdeburg, Germany 39106
Venue:
OR Spectrum
Year:
2013

Citing 9
Cited 0

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

Management Science
Scheduling under Fuzziness

Scheduling under Fuzziness
One Machine Scheduling Problem with Fuzzy Random Due-Dates

Fuzzy Optimization and Decision Making
Scheduling: Theory, Algorithms, and Systems

Scheduling: Theory, Algorithms, and Systems
A comparison of stochastic programming and bi-objective optimisation approaches to robust airline crew scheduling

OR Spectrum
Minimizing total weighted flow time under uncertainty using dominance and a stability box

Computers and Operations Research
Minimizing total weighted flow time of a set of jobs with interval 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
Minimizing maximal regret in the single machine sequencing problem with maximum lateness criterion

Operations Research Letters

Quantified Score

Hi-index	0.00

Visualization

Abstract

The paper deals with scheduling under uncertainty of the job processing times. The actual value of the processing time of a job becomes known only when the schedule is executed and may be equal to any value from the given interval. We propose an approach which consists of calculating measures of problem uncertainty to choose an appropriate method for solving an uncertain scheduling problem. These measures are based on the concept of a minimal dominant set containing at least one optimal schedule for each realization of the job processing times. For minimizing the sum of weighted completion times of the $$n$$ jobs to be processed on a single machine, it is shown that a minimal dominant set may be uniquely determined. We demonstrate how to use an uncertainty measure for selecting a method for finding an effective heuristic solution of the uncertain scheduling problem. The efficiency of the heuristic $$O(n\log n)$$ -algorithms is demonstrated on a set of randomly generated instances with $$100 \le n \le 5{,}000.$$ A similar uncertainty measure may be applied to many other scheduling problems with interval processing times.