Applying network flow and simulated annealing in job shop rescheduling due to machine breakdowns
Rescheduling is a kind of scheduling problem applied in a changing manufacturing environment, where the initial schedule cannot be used in the new situation. This research applies a network flow structure and net change to develop an algorithm for selecting only the affected operations in a machine breakdown; a simulated annealing algorithm will then be used to revise the changed schedule to minimize makespan. The new method will avoid wasting time on counting those unaffected operations by the machine breakdown event, and maintains the new schedule in an objective of performance measures. This new rescheduling method is coded in FORTRAN. It compares a traditional rescheduling method with the makespan of a revised schedule and the execution time for generating the new schedule.
School Location:USA - Ohio
Source Type:Master's Thesis
Keywords:annealing algorithm fortran makespan
Date of Publication:01/01/1996