Hybrid Ant Colony Algorithm for Job Shop Schedule with Unrelated Parallel Machines

Jie Zhang; Guo Bao Liu

doi:10.4028/www.scientific.net/AMR.430-432.905

Paper Titles

Application of Frequency Conversion in Preparation of Semisolid A356 Alloy Slurry
p.886

Effect of Exopolysaccharide Producing Lactic Acid Bacterial on the Gelation and Texture Properties of Yogurt
p.890

Morphology and Structure Properties of PEG-b-PBT, PEG-b-PBT-HA Nanofibers Based Gas-Electrospun
p.894

Comparison of Detection Methods of Pore Characteristic of Inkjet Paper Coating
p.898

Hybrid Ant Colony Algorithm for Job Shop Schedule with Unrelated Parallel Machines
p.905

Effect of Glass Fiber Modification on Tensile Strength and Shrinkage of Ceramic Mould
p.909

Spinning Technics Research of St.Ma/Polyester Blended Hard Twist Slub Yarn
p.913

Preparation of Al₂O₃-Supported Ni Catalyst and its Catalytic Hydrogenation Performance
p.917

A General Approach for Automatically Constructing CAD Models of Human Teeth
p.921

HomeAdvanced Materials ResearchAdvanced Materials Research Vols. 430-432Hybrid Ant Colony Algorithm for Job Shop Schedule...

Hybrid Ant Colony Algorithm for Job Shop Schedule with Unrelated Parallel Machines

Abstract:

According to the widely existing job shop schedule with unrelated parallel machines in the actual manufacturing system, a static model with minimize makespan as optimization goal was established, considering precedence, machine-dependent and sequence-dependent setup times. Since basic ant colony algorithm usually has shortcomings such as long searching time, easy trapped into local optimal solutions, this paper puts forward a hybrid ant colony algorithm adopting elite strategy and maximum and minimum ant colony mechanism. Its performance is evaluated by comparing its solutions with genetic algorithm in the literature. The results indicate the proposed algorithm significantly outperforms the competitor.

You might also be interested in these eBooks

Frontiers of Advanced Materials and Engineering Technology

View Preview

Info:

Periodical:

Advanced Materials Research (Volumes 430-432)

Pages:

905-908

DOI:

https://doi.org/10.4028/www.scientific.net/AMR.430-432.905

Citation:

Cite this paper

Online since:

January 2012

Authors:

Jie Zhang, Guo Bao Liu

Keywords:

Ant Colony Algorithm (ACA), Job Shop, Make Span, Unrelated Parallel Machines

Export:

RIS, BibTeX

Price:

Permissions CCC:

Request Permissions

Permissions PLS:

Request Permissions

Сopyright:

Citation:

References

[1] RM Karp: Reducibility among combinatorial problems. In: Miller RE, Thatcher JW (eds) Complexity of computer computations. Plenum, New York, p.85–103(1972).

DOI: 10.1007/978-1-4684-2001-2_9

Google Scholar

[2] M. Pfund, J. W Fowler, JND Gupta : A survey of algorithms for single and multi-objective unrelated parallel machine deterministic scheduling problems. J Chin Inst Ind Eng 21(3) (2004): 230–241.

DOI: 10.1080/10170660409509404

Google Scholar

[3] H.B. Duan, Ant colony algorithm theory [M], Science Press, Beijing, 2005, pp.47-89.

Google Scholar

[4] R.M. Aiex, S. Binato, M.G.C. Resende. Parallel GRASP with path-relinking for job shop scheduling. Parallel Computing (2003), 29: 393–430.

DOI: 10.1016/s0167-8191(03)00014-0

Google Scholar

[5] C.F. LIAW, Y.K. LIN, C.Y. CHENG, et al. Scheduling unrelated parallel machines to minimize total weighted tardiness. [J]. Computers & Operations Research，2003, 30(12): 1777-1789.

DOI: 10.1016/s0305-0548(02)00105-3

Google Scholar