ACM Home Page
Please provide us with feedback. Feedback
Discrete differential evolution algorithm for the job shop scheduling problem
Full text PdfPdf (575 KB)
Source
ACM/SIGEVO Summit on Genetic and Evolutionary Computation archive
Proceedings of the first ACM/SIGEVO Summit on Genetic and Evolutionary Computation table of contents
Shanghai, China
POSTER SESSION: Poster sessions table of contents
Pages 879-882  
Year of Publication: 2009
ISBN:978-1-60558-326-6
Authors
Fang Liu  Key Laboratory of Intelligent Perception and Image Understanding of Ministry of Education of China, Xi'an, China
Yutao Qi  Key Laboratory of Intelligent Perception and Image Understanding of Ministry of Education of China, Xi'an, China
Zhuchang Xia  Key Laboratory of Intelligent Perception and Image Understanding of Ministry of Education of China, Xi'an, China
Hongxia Hao  Key Laboratory of Intelligent Perception and Image Understanding of Ministry of Education of China, Xi'an, China
Sponsors
SIGEVO: ACM Special Interest Group on Genetic and Evolutionary Computation
ACM: Association for Computing Machinery
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 13,   Downloads (12 Months): 38,   Citation Count: 0
Additional Information:

abstract   references   index terms   collaborative colleagues  

Tools and Actions: Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1543834.1543965
What is a DOI?

ABSTRACT

Differential Evolution (DE) Algorithm is a new evolutionary computation algorithm with rapid convergence rate. However, it does not perform well on dealing with job shop scheduling problems that have discrete decision variables. To remedy this, a Discrete Differential Evolution (DDE) Algorithm with special crossover and mutation operators is proposed to solve this problem. Under the skeleton of DE algorithm, The DDE algorithm inherits the advantage of rapid convergence rate. The experimental results on the well-known benchmark instances show the proposed algorithm is efficient in solving Job Shop Scheduling Problem


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
Christos Dimopoulos and Ali M. S. Zalzala. Recent developments in evolutionary computation for manufacturing optimization: problems solutions and comparisons. IEEE transactions on evolutionary computation. vol.4, no.2, July 2000, PP.93--113.
 
2
Krishna K., Ganeshan K., Ram D.J. Distributed simulated annealing algorithms for job shop scheduling. IEEE Transactions on Systems, Man and Cybernetics. vol. 25, Issue.7, 1995, PP.1102--1109.
 
3
Guohua Wan, Feng Wan. Job shop scheduling by taboo search with fuzzy reasoning. IEEE International Conference on Systems, Man and Cybernetics, 2003. vol.2, 2003, PP.1566--1570.
 
4
 
5
Chen xiong, Kong qingsheng, and Wu qidi. Hybrid algorithm for job-shop scheduling problem. In: Proceedings of the 4th World Congress on Intelligent Control and Automation. 2002.
 
6
Tamaki H, Nishikawa Y. A parallel genetic algorithm based on neighborhood model and its application to the job shop scheduling. In: Parallel Problem Solving from nature II, Elsevier Science, 1992, PP.573--582.
 
7
 
8
Nasimul Noman and Hitoshi Iba. Accelerating differential evolution using an adaptive local search. IEEE transaction on evolutionary computation. vol.12, no.2, February 2008, PP.107--125.
 
9
Fatih Tasgetiren. M, Quan-Ke Pan, Suganthan, P.N. Yun-Chia Liang. A Discrete Differential Evolution Algorithm for the No-Wait Flowshop Scheduling Problem with Total Flowtime Criterion. Computational Intelligence in Scheduling, 2007. SCIS '07. IEEE Symposium on 1--5 April 2007 Page(s):251 --- 258.

Collaborative Colleagues:
Fang Liu: colleagues
Yutao Qi: colleagues
Zhuchang Xia: colleagues
Hongxia Hao: colleagues