Comparison of the DISASTER (Trademark) Scheduling Software with a SimultaneousScheduling Algorithm for Minimizing Maximum Tardiness in Job Shops

摘要

The Theory of Constraints (TOC) is the foundation for a computerized schedulingsystem called DISASTER. Although this system has proven successful in many manufacturing settings, it has potential limitations due to the sequential heuristic process by which it schedules constraints. The objective of this thesis was to determine the extent to which these limitations impact the due date performance of schedules created by DISASTER. This objective was addressed by developing an algorithm to simultaneously schedule multiple constraints in a job shop environment and provide the optimal schedule for minimized maximum tardiness. This algorithm was used to obtain solutions for a matrix of job shop problems, which were compared with solutions obtained by using DISASTER. This comparison showed that DISASTER is capable of producing nearly optimal solutions for minimized maximum tardiness, but that this capability is highly dependent on proper constraint sequencing. Theory of constraints, Job shop scheduling, Production, Scheduling, Computer programs, Tardiness, Branch and bound.