Answers are grounded in this paper and cite their sources.
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.
No takes yet. Share an insight, caveat, or question.
Chang et al. (1990) studied this question.
Synapse has enriched 5 related papers. Consider them for comparative context: