Scheduling Jobs on Batch Machines Based on Ant Colony Algorithms

Xia Bao Huang

doi:10.4028/www.scientific.net/AMM.670-671.1522

Paper Titles

Theory and Technology Research on the Software Health Management
p.1503

Research of Intrusion Detection System Object Oriented Modeling
p.1507

A Novel Influence Measure Algorithm for Social Networks
p.1511

Particle Swarm Algorithm Based on Boundary Buffering-Natural Evolution and its Application in Constrained Optimization
p.1517

Scheduling Jobs on Batch Machines Based on Ant Colony Algorithms
p.1522

Study of Wind Farm Power Output Predicting Model Based on Nonlinear Time Series
p.1526

The Construction of Biorthogonal High Dimensional Wavelet Packets
p.1530

Design and Implementation of Network Leave Examination and Approval System Based on CRP Digital Campus Information Management Platform
p.1536

Track Routing Optimization Model Based on Fuzzy Clustering Method
p.1540

HomeApplied Mechanics and MaterialsApplied Mechanics and Materials Vols. 670-671Scheduling Jobs on Batch Machines Based on Ant...

Scheduling Jobs on Batch Machines Based on Ant Colony Algorithms

Abstract:

Scheduling jobs on batch machines has a significant impact on the performance indicators utilization. We used ant colony algorithms to improve performance of the scheduling jobs on batch machines in the semiconductor fabrication with multi-priority orders. To minimize total tardiness penalty, the improved ant colony algorithms was used to perform batches forming and batches sorting respectively, which are the two sub-problem of batch machines’ scheduling. The simulation results show that the scheduling performance by our proposed algorithm is better than the heuristic rules, and the more percentage of emergency orders, the better it is.

You might also be interested in these eBooks

Applied Mechanics, Materials and Manufacturing IV

View Preview

Info:

Periodical:

Applied Mechanics and Materials (Volumes 670-671)

Pages:

1522-1525

DOI:

https://doi.org/10.4028/www.scientific.net/AMM.670-671.1522

Citation:

Cite this paper

Online since:

October 2014

Authors:

Xia Bao Huang*

Keywords:

Ant Colony Algorithms, Batch Machines, Job Scheduling, Multi-Priority Orders

Export:

RIS, BibTeX

Price:

Permissions CCC:

Request Permissions

Permissions PLS:

Request Permissions

Сopyright:

Citation:

* - Corresponding Author

References

[1] V. Erramilli, S.J. Mason, Multiple orders per job compatible batch scheduling, IEEE Trans. Electron. Packag. Manuf. 29 (2006) 285-296.

DOI: 10.1109/tepm.2006.887355

Google Scholar

[2] Q.Q. Nong, C.T. Ng, T.C. E Cheng, The bounded single-machine parallel-batching scheduling problem with family jobs and release dates to minimize makespan, Oper. Res. Lett. 36 (2008) 61-66.

DOI: 10.1016/j.orl.2007.01.007

Google Scholar

[3] S. Melouk, P. Damodaran, P.Y. Chang, Minimizing makespan for single machine batch processing with non-identical job sizes using simulated annealing, Int. J. Prod. Econ. 87 (2004) 141-147.

DOI: 10.1016/s0925-5273(03)00092-6

Google Scholar

[4] L. Mönch, H. Balasubramanian, J.W. Fowler, M.E. Pfund, Heuristic scheduling of jobs on parallel batch machines with incompatible job families and unequal ready times, Comput. Oper. Res. 32 (2005) 2731-2750.

DOI: 10.1016/j.cor.2004.04.001

Google Scholar

[5] P. Damodaran, K. Srihari, S.S. Lam, Scheduling a capacitated batch-processing machine to minimize makespan, Robot. Cim-int. Manuf. 23 (2007) 208-216.

DOI: 10.1016/j.rcim.2006.02.012

Google Scholar