Minmax Regret Algorithms for Uncertain PCmax Problem with Interval Processing Times

We consider P| |Cmax scheduling problem where it is assumed that processing times of tasks are not known apriori, but they belong to the intervals of known bounds. The worst-case absolute regret is used to evaluate the resulting uncertain NP-hard problem. We prove that no approximation algorithm exists for solving that version of the problem and present two heuristic algorithms. We report the results of the computational experiments comparing elaborated algorithms.