Dynamic optimization of job distribution on machine tools using time decomposition into constant job-mix stages

This thesis deals with the development, analysis and application of a new method to optimize the allocation of jobs on machine tools. The benefits of this method are derived through time-decomposition of the scheduling horizon.;The application of the algorithm is demonstrated for three different cases. The first two cases focus on single operation jobs and represent two different approaches to scheduling. The third case deals with the assignment of multiple operation jobs to machine tools which are grouped according to processes. (Abstract shortened by UMI.).;The decomposition scheme is based on the scheduled flow of jobs i.e., the input of jobs to the shop floor and their departure after processing. The partitioning procedure divides the planning horizon into 'stages', or time periods, at which the job-mix remains constant. The optimization of job allocation is carried out within each partition and successive stages are treated sequentially. The dynamic nature of the problem is such that the solution at a stage affects the boundary conditions of the subsequent stage. The Constant Job-Mix Stage (CMS) algorithm developed to solve the job allocation problem, accounts of the setup times and enables one to obtain integer solutions while reducing slack on machines and enforcing due date on jobs.