Scheduling batch processing machine using max-min ant system algorithm improved by a local search method
type: Item
instance of: scholarly article
title: Scheduling batch processing machine using max-min ant system algorithm improved by a local search method
zbMATH Open document ID: 1427.90153
DOI: 10.1155/2018/3124182
author: Yu Wang
author: Xiaolin Li
published in: Mathematical Problems in Engineering
publication date: 2019-02-08T00:00:00Z
review text: Summary: 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.
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 90C59
Mathematics Subject Classification ID: 90C27
zbMATH DE Number: 7018767
describes a project that uses: CPLEX
MaRDI profile type: Publication
full work available at URL: https://doi.org/10.1155/2018/3124182
OpenAlex ID: W2785313725
cites work: Efficient scheduling algorithms for a single batch processing machine
cites work: Efficient Algorithms for Scheduling Semiconductor Burn-In Operations
cites work: Minimizing makespan on a single burn-in oven in semiconductor manufacturing
cites work: Scheduling a single batch processing machine with non-identical job sizes
cites work: Minimizing the makespan on a batch machine with non-identical job sizes: An exact procedure
cites work: A particle swarm optimizer for grouping problems
cites work: Ant colony optimization theory: a survey
cites work: Makespan minimization on single batch-processing machine via ant colony optimization
cites work: An ant colony optimisation algorithm for solving the asymmetric traffic assignment problem
cites work: Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms
cites work: General local search methods
description: scientific article; zbMATH DE number 7018767