A bat algorithm for job scheduling in ceramics production lines

The wide array of products manufactured in ceramics production lines and their manufacturing limitations fall into the job scheduling environment. Task scheduling involved in this problem's variant has already been solved by several authors' approaches [1]. That said, this paper intends to propose the use of a relatively new metaheuristics called bat algorithm [3] (BA) to solve such scenarios. Our study includes a numerical experimentation process which confronts the proposed BA algorithm against a Genetic algorithm [2] and a GRASP algorithm [1].