Scheduling batch processing machine using max-min ant system algorithm improved by a local search method

DOI10.1155/2018/3124182zbMath1427.90153OpenAlexW2785313725MaRDI QIDQ1720742

Yu Wang, Xiao-Lin Li

Publication date: 8 February 2019

Published in: Mathematical Problems in Engineering (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1155/2018/3124182

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Related Items (1)

Construction of Schedules for the Performance of Task Packages in Multi-Stage Systems when Forming Sets of Results and Limitations

Uses Software

• CPLEX

Cites Work

• An ant colony optimisation algorithm for solving the asymmetric traffic assignment problem
• A particle swarm optimizer for grouping problems
• Efficient scheduling algorithms for a single batch processing machine
• General local search methods
• Minimizing makespan on a single burn-in oven in semiconductor manufacturing
• Makespan minimization on single batch-processing machine via ant colony optimization
• Ant colony optimization theory: a survey
• Efficient Algorithms for Scheduling Semiconductor Burn-In Operations
• Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms
• Scheduling a single batch processing machine with non-identical job sizes
• Minimizing the makespan on a batch machine with non-identical job sizes: An exact procedure

This page was built for publication: Scheduling batch processing machine using max-min ant system algorithm improved by a local search method