Minimizing maximal regret in the single machine sequencing problem with maximum lateness criterion

Authors:
Adam Kasperski
Affiliations:
Institute of Industrial Engineering and Management, Wrocław University of Technology, Wybrzee Wyspiańskiego 27, 50-370 Wrocław, Poland
Venue:
Operations Research Letters
Year:
2005

Citing 3
Cited 8

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

Management Science
Scheduling Algorithms

Scheduling Algorithms
Minmax regret solutions for minimax optimization problems with uncertainty

Operations Research Letters

Improved polynomial algorithms for robust bottleneck problems with interval data

Computers and Operations Research
Analysis of robustness in proactive scheduling: A graphical approach

Computers and Industrial Engineering
Scheduling with uncertainties on new computing platforms

Computational Optimization and Applications
Minimizing total weighted flow time under uncertainty using dominance and a stability box

Computers and Operations Research
Robust scheduling on a single machine to minimize total flow time

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
Complexity of single machine scheduling problems under scenario-based uncertainty

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, the single machine sequencing problem with maximum lateness criterion is discussed. The parameters of the problem are imprecise and they are specified as intervals. The maximal regret criterion is applied to calculate the optimal sequence. A polynomial algorithm for the studied problem is constructed.