1. Local search algorithm with path relinking for single batch-processing machine scheduling problem.
- Author
-
Zhang, Xin, Li, Xiangtao, and Wang, Jianan
- Subjects
BATCH processing ,GENETIC algorithms ,PROBLEM solving ,ANT algorithms ,SEARCH algorithms ,COMPUTER scheduling - Abstract
The single batch-processing machine problem is to minimize makespan, which has broad applications, including engineering fundamentals and theoretical background. The machine can process several jobs as a batch simultaneously, and every job has three different attributes: job size, processing time, and job arrival. In this paper, a hybrid local search algorithm with path relinking (LP) is devised to solve the problem. We not only generate an optimal initial solution firstly but also pay more attention to improving the solution quality. Three kinds of local searches are applied to enhance the diversity of solutions; the path relinking is adopted to explore better solutions through local tracks connecting the current solution and the best in the elite set. With these approaches, it can keep a balanced rate between exploratory and exploitative capacity. Computational experiments on 40 benchmark instances indicate that LP has the superior convergence and robust performance and it surpasses the current state-of-the-art methods such as genetic algorithm and ant colony optimization, especially for large instances. [ABSTRACT FROM AUTHOR]
- Published
- 2017
- Full Text
- View/download PDF