Solving Multi-Stage Multi-Machine Multi-Product Scheduling Problem Using Bat Algorithm

Abstract

Bat Algorithm is one of the recently-developed nature-inspired methods in the field of computational intelligence. This work presents the development of the B at A lgorithm based S cheduling T ool (BAST) that used to solve multi-stage multi-machine multi-product scheduling problems. The algorithm takes into account the Just-in-Time production philosophy by aiming to minimise the combination of earliness and tardiness penalty costs. The computational experiment on the BAST was conducted using data obtained from a collaborating company engaged in capital goods industry. The experimental results indicated that the BA performance can be improved up to 8.37% after adopting the appropriate parameters' setting.