Solving the Job Shop Scheduling Problem Using the Imperialist Competitive Algorithm

Jie Zhang; Peng Zhang; Jian Xiong Yang; Ying Huang

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

Paper Titles

Oa-Based Workflow Process Design and Implementation of Approval Procedures
p.719

Effect of Annealing Temperature on Phosphorus Segregation at Grain Boundary in a Ti-IF Steel
p.724

Preparation and Properties of Sulfonated β-Cyclodextrins Used as Water-Reducer
p.729

Discussion on the Sustainable Development of Urban Water Conservancy Infrastructure Construction
p.733

Solving the Job Shop Scheduling Problem Using the Imperialist Competitive Algorithm
p.737

A Novel Rigid Vacuum Insulation Panel: Vacuum Insulation Sandwich
p.741

Temperature Field of Doublet-Wells Aquifer Thermal Energy Storage in Sanhejian Coal Mine
p.746

Simulation Study on the Fluid-Solid Coupled Heat Transfer of Cylinder Head
p.750

Research on Contact Deformation and Influencing Factor of Ball Screw
p.755

HomeAdvanced Materials ResearchAdvanced Materials Research Vols. 430-432Solving the Job Shop Scheduling Problem Using the...

Solving the Job Shop Scheduling Problem Using the Imperialist Competitive Algorithm

Abstract:

This paper deals with the Job Shop Scheduling Problem with the minimization of makespan as the objective. A novel meta-heuristic named imperialist competitive algorithm (ICA) is adopted to solve the problem. Since appropriate design of the parameters has a significant impact on the performance of the algorithm, the parameters were chosen based on orthogonal test. A local search strategy based on critical path and critical block was used to improve the performance of the algorithm. At last the algorithm was tested on a set of standard benchmark instances, and the computational results showed that the algorithm proposed performed well in both convergence rate and better global optima achievement.

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:

737-740

DOI:

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

Citation:

Cite this paper

Online since:

January 2012

Authors:

Jie Zhang, Peng Zhang, Jian Xiong Yang, Ying Huang

Keywords:

Critical Block, Imperialist Competitive Algorithm, Job Shop Scheduling Problem

Export:

RIS, BibTeX

Price:

Permissions:

Request Permissions

References

[1] E. Atashpaz-Gargari, C. Lucas, Imperialist competitive algorithm: An algorithm for optimization inspired by imperialistic competition, IEEE Congress on Evolutionary Computation. 2007, p.4661–4667.

DOI: 10.1109/cec.2007.4425083

Google Scholar

[2] S. Nazari-Shirkouhi, H. Eivazy, K. Rezaie et al, Solving the integrated product mix-outsourcing problem using the Imperialist Competitive Algorithm, Expert Systems with Applications. 2010, pp.7615-7626.

DOI: 10.1016/j.eswa.2010.04.081

Google Scholar

[3] M. Bagher, M. Zandieh, H. Farsijani, Balancing of stochastic U-type assembly lines: An imperialist competitive algorithm, Int J Adv Manuf Technol. (2010).

DOI: 10.1007/s00170-010-2937-3

Google Scholar

[4] E. Shokrollahpour, M. Zandieh, B. Dorri, A novel imperialist competitive algorithm for bi-criteria scheduling of the assembly flowshop problem, International Journal of Production Research. (2011).

DOI: 10.1080/00207540903536155

Google Scholar

[5] JSP Benchmark Problem on ftp: /mascmga. ms. ic. ac. uk/ pub/ jobshop1(2). Txt, 2004 04.

Google Scholar