RELATIVE ROBUSTNESS FOR SINGLE-MACHINE SCHEDULING PROBLEM WITH PROCESSING TIME UNCERTAINTY

ABSTRACT Uncertainty can be found in numerous parts of the manufacturing environments. The uncertain processing time is one of the most prevalent. We consider a single-machine environment in which the processing times of individual jobs are uncertain and the performance measure of interest is the criteria of the total flow time. The processing times uncertainty can be realized in a specified range or a discrete number of distinct processing times in each job. Confronted with the uncertainty, the concept of robust optimization was introduced. The measures of deviation and relative robustness are used to tackle the uncertainty. We model the robust scheduling problems and properly incorporate relative robust schedules problem into fractional programming problems. Bisection searches based on parametric approach are prepared for the relative robust scheduling problem.