A novel hybrid method for solving flexible job-shop scheduling problem

被引：0

作者：

Ning T. ^{[1
,2
]}

Guo C. ^{[2
]}

Chen R. ^{[2
]}

Jin H. ^{[1
]}

机构：

[1] College of Software, Dalian Jiaotong University

[2] College of Information Science and Technology, Dalian Maritime University

来源：

Open Cybernetics and Systemics Journal | 2016年 / 10卷

关键词：

Double chains coding; Flexible job-shop scheduling problem; Penalty coefficient; Quantum algorithm;

D O I：

10.2174/1874110X01610010013

中图分类号：

学科分类号：

摘要：

For the purpose of solving the flexible job-shop scheduling problem (FJSP), an improved quantum genetic algorithm based on earliness/tardiness penalty coefficient is proposed in this paper. For minimizing the completion time and the job-shop cost, a simulation model was established firstly. Next, according to the characteristics of the due in production, a double penalty coefficient was designed and a double chains coding method was proposed. At last, the effectiveness of the proposed method is verified through being applied to the Kacem example and compared with some existing algorithms. © Ning et al.; Licensee Bentham Open.

引用

页码：13 / 19

页数：6

共 11 条

[1]

Bucker P., Schlie R., Job-shop scheduling with multi-purpose machines, Computing, 45, 4, pp. 369-375, (1990)

[2]

Qi J.G., Burns G.R., Harrison D.K., The application of the parallel multi-population genetic algorithm to dynamic job shop scheduling, International Journal of Advanced Manufacturing Technology, 16, pp. 609-615, (2000)

[3]

Weihong B.I., Ren H., Wu Q., A new elitist strategy in genetic algorithm, Journal of Zhejiang University, 33, 1, pp. 32-35, (2006)

[4]

Ning T., Guo C., Chen R., A novel method for dynamic vehicle routing problem, Open Cybernetics & Systemic Journal, 9, 15, pp. 1-5, (2015)

[5]

Ning T., Chen R., Guo C., Xu L., A scheduling strategy for dynamic vehicle routing problem based on double chains coding, Operations Research Transactions, 19, 2, pp. 72-83, (2015)

[6]

Liu Q., Zhang C., Rao Y., Shao X., Flexible job-shop scheduling problem with improved genetic algorithm, Industrial Engineering and Management, 14, 2, pp. 59-66, (2009)

[7]

Ning T., "Study of Application of Hybrid Quantum Algorithm in Vehicle Routing Problem", thesis, (2013)

[8]

Zhang J., Wang W., Xu X., Jie J., Hybrid particle-swarm optimization for multi objective flexible job-shop scheduling problem, Control Theory & Applications, 29, 6, pp. 30-37, (2012)

[9]

Kacem I., Hammadi S., Borne P., Approach by localization and multi-objective evolutionary optimization for flexible job-shop scheduling problems, IEEE Transactions on Systems, Man, and Cybernetics, 32, 1, pp. 1-13, (2002)

[10]

Wang Y., Feng Y., Tan J., Li Z., Optimization method of flexible job-shop scheduling based on multiobjective particle swarm optimization algorithm, Transactions of the Chinese Society for Agricultural Machinery, 42, 2, pp. 190-196, (2011)

← 1 2 →