Future Generation Computer Systems
Minimizing the makespan on a batch machine with non-identical job sizes: an exact procedure
Computers and Operations Research
Ant Colony Optimization
A MAX-MIN ant system for unconstrained multi-level lot-sizing problems
Computers and Operations Research
Genetic algorithm with ant colony optimization (GA-ACO) for multiple sequence alignment
Applied Soft Computing
A new minimum pheromone threshold strategy (MPTS) for max-min ant system
Applied Soft Computing
Note: A note on minimizing makespan on a single batch processing machine with nonidentical job sizes
Theoretical Computer Science
Makespan minimization on single batch-processing machine via ant colony optimization
Computers and Operations Research
Ant colony system: a cooperative learning approach to the traveling salesman problem
IEEE Transactions on Evolutionary Computation
A short convergence proof for a class of ant colony optimizationalgorithms
IEEE Transactions on Evolutionary Computation
Minimizing makespan on a single batching machine with release times and non-identical job sizes
Operations Research Letters
| Hi-index | 0.01 |
We consider the problem of minimizing the makespan on a single batch machine with non-identical job sizes, where several jobs can be simultaneously processed as a batch. We formulate makespan minimization as a problem of minimizing the wasted space. Applying a candidate set strategy to narrow the search space, combined with a wasted-space-based heuristic to update the pheromone information, an improved max-min ant system algorithm is presented. A specific local search method is incorporated to gain better performance. Appropriate parameter settings in the proposed algorithm are determined by extensive experiments. The experimental results show that the proposed algorithm outperforms several previously studied algorithms.