Scheduling Batch Processing Machine Using Max–Min Ant System Algorithm Improved by a Local Search Method

The problem of minimizing the makespan on single batch processing machine is studied in this paper. Both job sizes and processing time are nonidentical and the processing time of each batch is determined by the job with the longest processing time in the batch. Max–Min Ant System (MMAS) algorithm is developed to solve the problem. A local search method MJE (Multiple Jobs Exchange) is proposed to improve the performance of the algorithm by adjusting jobs between batches. Preliminary experiment is conducted to determine the parameters of MMAS. The performance of the proposed MMAS algorithm is compared with CPLEX as well as several other algorithms including ant cycle (AC) algorithm, genetic algorithm (GA), and two heuristics, First Fit Longest Processing Time (FFLPT) and Best Fit Longest Processing Time (BFLPT), through numerical experiment. The experiment results show that MMAS outperformed others especially for large population size

A survey of scheduling problems with setup times or costs

Author name used in this publication: C. T. NgAuthor name used in this publication: T. C. E. Cheng2007-2008 > Academic research: refereed > Publication in refereed journalAccepted ManuscriptPublishe