Scheduling with uncertain start dates

Abstract

In manufacturing scheduling, jobs may have uncertain earliest start times, caused by supplier lead-time uncertainty. How should we build initial schedules to be robust to these uncertain release dates? We are attempting to adapt the online decision making methods from [1]: in particular the expectation and consensus methods, which combine sampling of future scenarios with deterministic optimization. First, we assume that we have a probability distribution over the release dates, and we use this to select samples, giving them a weight proportional to their probability, which we use when determining the best decision. For expectation, we consider all possible partial schedules of released jobs up to the earliest possible uncertain release date (t 0), for each sample extend each partial schedule, and return the one with the lowest expected makespan. For consensus, we find the optimal decision for each sample, and then choose the one with the highest sum of weights. We consider three possible types of initial decision: (i) partial schedules up to to; (ii) independent resource assignments for a single time step; and (in) a tuple of resource assignments for a single time step. The latter two require re-optimization at each time-step up to t0. We have implemented the above in Hog Scheduler 6.0, and tested them on modified JSP benchmarks [2]. The experiments show that our four adapted methods all provide good results (i.e. weighted relative error not being more than 2%). However, it is also possible to get close to the optimal without reasoning about the uncertain events in advance (e.g. using pure reactive methods). The problems appear to be too easy, and not sensitive to the uncertainties. Future work will investigate why this is the case, to determine the features that do make the problems sensitive to the uncertainty in the release dates. © Springer-Verlag Berlin Heidelberg 2005.