Key points are not available for this paper at this time.
SUMMARY An extension of Giffler and Thompson's algorithm (1960)is developed to create all active schedules in a dynamic job shop. A partitioning scheme is also developed that works extremely well in reducing the number of active schedules created. This reduced enumeration method is much more efficient than the full generation scheme and, based upon the results of test problems, it appears to be nearly as effective.
Chang et al. (Mon,) studied this question.