Search heuristics for analysis of lot sizing on parallel machines with sequence-dependent set-up times

摘要

This research applies and compares Simulated Annealing and Tabu Search methodologies to find a solution for a schedule problem which is to minimize the total tardiness of n independent jobs non-preemptively on m parallel machines without idle time on the machines. Each job j has a processing time and a due date. It may be possible to split jobs into lots and it may be possible to process each lot on different machine. There are sequence-dependent set-up times among jobs. A constant set-up time is required for each lot of a job prior to each machine process the first item of each lot.