A genetic algorithm for robust schedules in a one-machine environment with ready times and due dates

Abstract.

Computing a schedule for a single machine problem is often difficult, but when the data are uncertain, the problem is much more complicated. In this paper, we modify a genetic algorithm to compute robust schedules when release dates are subject to small variations. Two types of robustness are distinguished: quality robustness or robustness in the objective function space and solution robustness or robustness in the solution space. We show that the modified genetic algorithm can find solutions that are robust with respect to both types of robustness. Moreover, the risk associated with a specific solution can be easily evaluated. The modified genetic algorithm is applied to a just-in-time scheduling problem, a common problem in many industries.