Parallel machine scheduling under uncertainty

Abstract

In this paper a parallel machine scheduling problem with uncertain processing times is discussed. This uncertainty is modeled by specifying a scenario set containing K distinct processing time scenarios. The ordered weighted averaging aggregation (OWA) operator, whose special cases are the maximum and Hurwicz criteria, is applied to compute the best schedule. Some new positive and negative approximation results concerning the problem are shown. © 2012 Springer-Verlag.