Makespan minimization on single batch-processing machine via ant colony optimization

Authors:
Rui Xu;Huaping Chen;Xueping Li
Affiliations:
Management School, University of Science and Technology of China, Hefei 230026, PR China and Department of Industrial and Information Engineering, University of Tennessee, 408 East Stadium Hall, K ...;Management School, University of Science and Technology of China, Hefei 230026, PR China;Department of Industrial and Information Engineering, University of Tennessee, 408 East Stadium Hall, Knoxville, TN 37996-0700, USA
Venue:
Computers and Operations Research
Year:
2012

Citing 10
Cited 4

Efficient algorithms for scheduling semiconductor burn-in operations

Operations Research
Minimizing makespan on a single burn-in oven with job families and dynamic job arrivals

Computers and Operations Research
A genetic algorithm to minimize maximum lateness on a batch processing machine

Computers and Operations Research
Ant Colony Optimization for the Total Weighted Tardiness Problem

PPSN VI Proceedings of the 6th International Conference on Parallel Problem Solving from Nature
Ant Colony Optimization

Ant Colony Optimization
The unbounded single machine parallel batch scheduling problem with family jobs and release dates to minimize makespan

Theoretical Computer Science
A genetic algorithm for minimizing maximum lateness on parallel identical batch processing machines with dynamic job arrivals and incompatible job families

Computers and Operations Research
Ant colony optimization combined with taboo search for the job shop scheduling problem

Computers and Operations Research
Ant system: optimization by a colony of cooperating agents

IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
Efficient scheduling algorithms for a single batch processing machine

Operations Research Letters

Literature review regarding Ant Colony Optimization applied to scheduling problems: Guidelines for implementation and directions for future research

Engineering Applications of Artificial Intelligence
Due-date assignment and machine scheduling in a low machine-rate situation with stochastic processing times

Computers and Operations Research
Scheduling unrelated parallel batch processing machines with non-identical job sizes

Computers and Operations Research
An improved meta-heuristic for makespan minimization of a single batch machine with non-identical job sizes

Computers and Operations Research

Quantified Score

Hi-index	0.01

Visualization

Abstract

This paper investigates the problem of minimizing makespan on a single batch-processing machine, and the machine can process multiple jobs simultaneously. Each job is characterized by release time, processing time, and job size. We established a mixed integer programming model and proposed a valid lower bound for this problem. By introducing a definition of waste and idle space (WIS), this problem is proven to be equivalent to minimizing the WIS for the schedule. Since the problem is NP-hard, we proposed a heuristic and an ant colony optimization (ACO) algorithm based on the theorems presented. A candidate list strategy and a new method to construct heuristic information were introduced for the ACO approach to achieve a satisfactory solution in a reasonable computational time. Through extensive computational experiments, appropriate ACO parameter values were chosen and the effectiveness of the proposed algorithms was evaluated by solution quality and run time. The results showed that the ACO algorithm combined with the candidate list was more robust and consistently outperformed genetic algorithm (GA), CPLEX, and the other two heuristics, especially for large job instances.