抄録
In this paper, we propose a dynamic job shop scheduling method to minimize tardiness with consideration to sequence dependent setup times. Schedules are generated using switching priority rules to increase due date allowances, which mean flexibility for uncertainty, to be robust in dynamic environment. Numerical experiments using two different s/p ratios (the ratio of mean setup time to mean processing time) show the effectiveness of the proposed method.
