期刊
JOURNAL OF MECHANICAL SCIENCE AND TECHNOLOGY
卷 29, 期 3, 页码 1273-1281出版社
KOREAN SOC MECHANICAL ENGINEERS
DOI: 10.1007/s12206-015-0242-7
关键词
FJSP; Scheduling; Genetic algorithm; Chromosome representation
资金
- Batna University
Flexible job-shop scheduling problem (FJSP), which is proved to be NP-hard, is an extension of the classical job-shop scheduling problem. In this paper, we propose a new genetic algorithm (NGA) to solve FJSP to minimize makespan. This new algorithm uses a new chromosome representation and adopts different strategies for crossover and mutation. The proposed algorithm is validated on a series of benchmark data sets and tested on data from a drug manufacturing company. Experimental results prove that the NGA is more efficient and competitive than some other existing algorithms.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据