EUVIMEDPoznaj EUVIMED
Open access · CC BY 4.0

A Hybrid Metaheuristic to Minimize Total Completion Time on Parallel Batch Machines with Unequal Capacities and Speeds

Yan Wang, Han Zhang, Jing Liu, Shuling Xu, Zhaohong Jia

Mathematics · 2026-11-13 · 14 (22) · 4167

DOI: 10.3390/math14224167 ↗

At a glance

Journal article in Mathematics, published online on 2026-11-13. Written by Yan Wang and 4 co-authors. 51 references. The full text is freely available (open access, CC BY 4.0). Funded by: National Natural Science Foundation of China, MOE Liberal Arts and Social Sciences Foundation, Anhui Provincial Natural Science Foundation.

AbstraktDane bibliograficzneCiteRelated studies

Abstract (original language)

This paper investigates the intelligent scheduling of semiconductor burn-in tests on heterogeneous automated testing equipment, modeled as non-identical parallel batch processing machines with different capacities and processing speeds. Jobs are characterized by release times, sizes, and processing times, and the objective is to minimize the total completion time. A mixed-integer programming (MIP) formulation is first developed to mathematically describe the problem. To efficiently solve large-scale instances, an evolutionary ant colony optimization with problem-specific local search (EACOL) is proposed. In EACOL, each ant uses a chromosome for job–machine assignment, while pheromone-guided decoding constructs batches and their processing order. A tailored local search operator is then applied to refine the constructed solutions, and evolutionary operators, including crossover and mutation, are employed to further improve the population. Pheromone trails are updated using the best retained schedule, enabling cooperative search at both the machine and job levels and reducing the risk of premature convergence. Experiments in two processing environments compare EACOL with RKGA, SA, IG, and MEASL. EACOL obtains a lower mean total completion time than MEASL on all 200 test instances.

Funding

  • National Natural Science Foundation of China
  • MOE Liberal Arts and Social Sciences Foundation
  • Anhui Provincial Natural Science Foundation
  • Fuyang Normal University
  • Anhui Provincial Philosophy and Social Sciences Planning Project
  • Anhui Normal University

Cite

APA

Wang, Y., Zhang, H., Liu, J., Xu, S., & Jia, Z. (2026). A Hybrid Metaheuristic to Minimize Total Completion Time on Parallel Batch Machines with Unequal Capacities and Speeds. Mathematics, 14(22), 4167. https://doi.org/10.3390/math14224167

Vancouver

Wang Y, Zhang H, Liu J, Xu S, Jia Z. A Hybrid Metaheuristic to Minimize Total Completion Time on Parallel Batch Machines with Unequal Capacities and Speeds. Mathematics. 2026;14(22):4167. doi:10.3390/math14224167

BibTeX
@article{Wang2026,
  author = {Wang, Yan and Zhang, Han and Liu, Jing and Xu, Shuling and Jia, Zhaohong},
  title = {A Hybrid Metaheuristic to Minimize Total Completion Time on Parallel Batch Machines with Unequal Capacities and Speeds},
  journal = {Mathematics},
  year = {2026},
  volume = {14},
  number = {22},
  pages = {4167},
  doi = {10.3390/math14224167}
}
Start for free →