Paper Titles

A Reliability Index Based Decoupling Method for Reliability-Based Design Optimization
p.223

The Multi-Objective Oriented Product Design Method in the Machine Tool
p.229

The Action Mechanism of the Layering User Demands in the Product R&D Process
p.235

Research on the Logistics Distribution under the Electronic Commerce Environment in Henan Province
p.240

Using the Memetic Algorithm for Multi Objective Job Shop Scheduling Problems
p.245

Method for Determining the Reliable Life Parameter of Turbine Wheel of Turbocharger with Over-Speed Failure Mode
p.251

Research of High Speed Train Carbody Structure Vibration Behaviors and Structure Fatigue Strength Characteristic Technology
p.256

Aging Properties of the Remaining Components of n-k+1 out of n Systems
p.262

Prediction of Deformations of Steel Plate by GEP in Forming Process
p.268

HomeAdvanced Materials ResearchAdvanced Materials Research Vol. 544Using the Memetic Algorithm for Multi Objective...

Using the Memetic Algorithm for Multi Objective Job Shop Scheduling Problems

Article Preview

Abstract:

The multi objective job shop scheduling problem is well known as one of the most complex optimization problems due to its very large search space and many constraint between machines and jobs. In this paper, an evolutionary approach of the memetic algorithm is used to solve the multi objective job shop scheduling problems. Memetic algorithm is a hybrid evolutionary algorithm that combines the global search strategy and local search strategy. The objectives of minimizing makespan and mean flow time are considered while satisfying a number of hard constraints. The computational results demonstrate the proposed MA is significantly superior to the other reported approaches in the literature.

You might also be interested in these eBooks

Advances in Product Development and Reliability III

Info:

Periodical:

Advanced Materials Research (Volume 544)

Pages:

245-250

DOI:

https://doi.org/10.4028/www.scientific.net/AMR.544.245

Citation:

Cite this paper

Online since:

June 2012

Authors:

Guo Hui Zhang

Keywords:

Job Shop Scheduling, Local Search, Memetic Algorithm, Multi-Objective

Export:

RIS, BibTeX

Price:

Permissions CCC:

Request Permissions

Permissions PLS:

Request Permissions

Сopyright:

© 2012 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

[1] M. R. Garey, D. S. Johnson, and R. Sethi, The complexity of flowshop and jobshop scheduling, Mathematics of Operations Research. 1 (1976) 117-129.

DOI: 10.1287/moor.1.2.117

[2] C. Akkan, S. Karabati, The two-machine flowshop total completion time problem: Improved lower bounds and a branch-and-bound algorithm, European Journal of Operational Research. 159 (2004) 420-429.

DOI: 10.1016/s0377-2217(03)00415-6

[3] T. Lorigeon, A dynamic programming algorithm for scheduling jobs in a two-machine open shop with an availability constraint, Journal of the Operational Research Society. 53 (2002) 1239-1246.

DOI: 10.1057/palgrave.jors.2601421

[4] A. Caumond, P. Lacomme, N. Tchernev, A memetic algorithm for the job-shop with time-lags, Computers & Operations Research. 35 (2008) 2331-2356.

DOI: 10.1016/j.cor.2006.11.007

[5] W. Q. Huang, A. H. Yin, An improved shifting bottleneck procedure for the job shop scheduling problem, Computers & Operations Research. 31 (2004) 2093-2110.

DOI: 10.1016/s0305-0548(03)00243-0

[6] C. Y. Zhang, P. G. Li, Z. L. Guan, Y. Q. Rao, A tabu search algorithm with a new neighborhood structure for the job shop scheduling problem, Computers & Operations Research. 34 (2007) 3229-3242.

DOI: 10.1016/j.cor.2005.12.002

[7] A. Udomsakdigool, V. Kachitvichyanukul, Multiple colony ant algorithm for job-shop scheduling problem, International Journal of Production Research. 46 (2008) 4155-4175.

DOI: 10.1080/00207540600990432

[8] J. T. Tsai, T. K. Liu, W. H. Ho, J. H. Chou, An improved genetic algorithm for job-shop scheduling problems using Taguchi-based crossover, International Journal of Advanced Manufacture Technology. 38 (2008) 987-994.

DOI: 10.1007/s00170-007-1142-5

[9] G. C. Luh, C. H. Chueh, A multi-modal immune algorithm for the job shop scheduling problem, Information Sciences. 179 (2009) 1516-1532.

DOI: 10.1016/j.ins.2008.11.029

[10] D. Y. Sha, C. Y. Hsu, A hybrid particle swarm optimization for job shop scheduling problem, Computers & Industrial Engineering. 51 (2006) 791-808.

DOI: 10.1016/j.cie.2006.09.002

[11] P. Moscato, M. G. Norman, A memetic approach for the traveling salesman problem implementation of a computational ecology for combinatorial optimization on message-passing systems, Parallel Computing and Transputer Applications. (1992) 177-186.

[12] Yang, J. H., Sun, L., Lee, H. P., Qian, Y., Liang, Y. C, Clonal selection based memetic algorithm for job shop scheduling problems, Journal of Bionic Engineering. 5 (2008) 111-119.

DOI: 10.1016/s1672-6529(08)60014-1

[13] A. Caumond, P. Lacomme, N. Tchernev, A memetic algorithm for the job-shop with time-lags, Computers & Operations Research. 35 (2008) 2331-2356.

DOI: 10.1016/j.cor.2006.11.007

[14] S. M. K. Hasan, R. Sarker, D. Essam, D. Cornforth, Memetic algorithm for solving job-shop scheduling problems, Memetic Computing. 1 (2009) 69-83.

DOI: 10.1007/s12293-008-0004-5

[15] G. H. Zhang, L. Gao, Y, Shi, A genetic algorithm and tabu search for multi objective flexible job shop scheduling problems, In: 1st International Conference on computing, control and Industrial Engineering (CCIE 2010), 2010, pp: 251-254.

DOI: 10.1109/ccie.2010.71

[16] L. Gao, G. H. Zhang, L. P. Zhang, X. Y. Li, An efficient memetic algorithm for solving the job shop scheduling problem, Computers & Industrial Engineering. 60 (2011) 699-705.

DOI: 10.1016/j.cie.2011.01.003

[17] J. E. Beasley, OR-Library: Distributing Test Problems by Electronic Mail, Journal of Operational Research Society, 41 (1990) 1069-1072.

DOI: 10.1057/jors.1990.166

[18] K. Deb, A. Pratap, S. Agarwal, T. Meyarivan, A fast and elitist multiobject genetic algorithm: NSGA-II, IEEE Trans. Evolutionary Computation, 6 (2002) 182-197.

DOI: 10.1109/4235.996017