The Impact of Processing Time Knowledge on Dynamic Job-Shop Scheduling

Abstract

The goal of this paper is to determine if the results for dynamic job-shop scheduling problems are affected by the assumptions made with regard to the processing time distributions and the scheduler's knowledge of the processing times. Three dynamic jobshop scheduling problems (including a two station version of Conway et al.'s [2] nine station symmetric shop) are tested under seven different scenarios, one deterministic and six stochastic, using computer simulation. The deterministic scenario, where the processing times are exponential and observed by the scheduler, has been considered in many simulation studies, including Conway et al's. The six stochastic scenarios include the case where the processing times are exponential and only the mean is known to the scheduler, and five different cases where the machines are subject to unpredictable failures. Two policies were tested, the shortest expected processing time (SEPT) rule, and a rule derived from a Brownian analysis of the corresponding queueing network scheduling problem. Although the SEPT rule performed well in the deterministic scenario, it was easily outperformed by the Brownian policies in the six stochastic scenarios for all three problems. Thus, the results from simulation studies of dynamic, deterministic job-shop scheduling problems do not necessarily carry over to the more realistic setting where there is unpredictable variability present.