Simulated annealing approach for minimizing makespan of a batch processing machine with unequal job ready times
Proceedings of the 2020 IISE Annual Conference
Batch Processing Machines (BPMs) are commonly used in semi-conductor manufacturing, metal working, and contract electronics manufacturing – to name a few. This research aims at developing an effective and efficient solution approach for scheduling jobs on a single BPM. Given a set of jobs with their processing times, ready times, and sizes, batches are formed and scheduled on a BPM to minimize makespan. The machine can process a batch as long as the total size of all the jobs assigned to the batch do not exceed the machine capacity. The processing time of the batch is equal to the longest processing time of all the jobs assigned to a batch. The ready time of the batch is equal to the latest ready time of all the jobs assigned to a batch. As the problem is NP-hard, a Simulated Annealing (SA) approach is developed and its solution is compared to a commercial solver used to solve a mathematical formulation. An experimental study highlights the effectiveness of the SA approach in solving larger problem instances.
Batch Processing Machine, Makespan, Scheduling, Simulated Annealing
Ghrayeb, Leena and Damodaran, Purushothaman, "Simulated annealing approach for minimizing makespan of a batch processing machine with unequal job ready times" (2020). NIU Bibliography. 149.
Department of Industrial and Systems Engineering