A genetic algorithm embedded with a concise chromosome representation for distributed and flexible job-shop scheduling problems
檔案
本條目沒有附加檔案。
日期
2018-01-01
類型
系所
期刊名稱
JOURNAL OF INTELLIGENT MANUFACTURING
卷期與頁次
第 29 卷,頁 19–34
ISSN
0956-5515
語言
英文
摘要
This paper proposes a genetic algorithm for solving distributed and flexible job-shop scheduling (DFJS) problems. A DFJS problem involves three scheduling decisions: (1) job-to-cell assignment, (2) operation-sequencing, and (3) operation-to-machine assignment. Therefore, solving a DFJS problem is essentially a 3-dimensional solution space search problem; each dimension represents a type of decision. The algorithm is developed by proposing a new and concise chromosome representation , which models a 3-dimensional scheduling solution by a 1-dimensional scheme (i.e., a sequence of all jobs to be scheduled). That is, the chromosome space is 1-dimensional (1D) and the solution space is 3-dimensional (3D). In , we develop a 1D-to-3D decoding method to convert a 1D chromosome into a 3D solution. In addition, given a 3D solution, we use a refinement method to improve the scheduling performance and subsequently use a 3D-to-1D encoding method to convert the refined 3D solution into a 1D chromosome. The 1D-to-3D decoding method is designed to obtain a "good" 3D solution which tends to be load-balanced. In contrast, the refinement and 3D-to-1D encoding methods of a 3D solution provides a novel way (rather than by genetic operators) to generate new chromosomes, which are herein called shadow chromosomes. Numerical experiments indicate that outperforms the IGA developed by De Giovanni and Pezzella (Eur J Oper Res 200:395-408, 2010), which is the up-to-date best-performing genetic algorithm in solving DFJS problems.
關鍵詞
Genetic algorithmDistributed flexible job-shopChromosome representationChromosome spaceSolution spaceShadow chromosomes所屬典藏
期刊論文引用此條目
Lu, P.-H., Wu, M.-C., Tan, H., Peng, Y.-H., & Chen, C.-F. (2018). A genetic algorithm embedded with a concise chromosome representation for distributed and flexible job-shop scheduling problems. JOURNAL OF INTELLIGENT MANUFACTURING, 29, 19–34. https://doi.org/10.1007/s10845-015-1083-z
引用文字依 APA 第 7 版格式自動產生,使用前請再核對。
分享
永久網址:https://ir.lib.nycu.edu.tw/handle/11536/144317