Minimizing Makespan for a Single Batch Processing Machine with Non-identical Job Sizes Using Neural Nets Approach

被引：0

作者：

Shao, Hao ^{[1
]}

Chen, Hua-Ping ^{[1
]}

Xu, Rui ^{[1
]}

Zhang, Wen-Gong ^{[1
]}

机构：

[1] Univ Sci & Technol China, Dept Informat Management & Decis Sci, Hefei 230026, Anhui, Peoples R China

来源：

ICNC 2008: FOURTH INTERNATIONAL CONFERENCE ON NATURAL COMPUTATION, VOL 6, PROCEEDINGS | 2008年

关键词：

D O I：

10.1109/ICNC.2008.368

中图分类号：

TP18 [人工智能理论];

学科分类号：

081104 ; 0812 ; 0835 ; 1405 ;

摘要：

This paper aims at minimizing the makespan for a single batch processing machine with non-identical job sizes (NSBM) using neural nets (NN) approach. NN approach was proved effective to solve combinatorial optimization problems but no application to NSBM problems hitherto. This research provides new methods to code the NN with the introduction of Master Weight Matrix (MWM). Computational experiments show that the NN approach outperforms other algorithms in various circumstances.

引用

页码：511 / 514

页数：4

共 50 条

[1] Minimizing makespan for parallel batch processing machines with non-identical job sizes using neural nets approach
Shao, Hao
Chen, Hua-Ping
Huang, George Q.
Xu, Rui
Cheng, Ba-yi
Wang, Shuan-shi
Liu, Bo-wen
[J]. ICIEA 2008: 3RD IEEE CONFERENCE ON INDUSTRIAL ELECTRONICS AND APPLICATIONS, PROCEEDINGS, VOLS 1-3, 2008, : 1921 - 1924
[2] Minimizing makespan on a single batch processing machine with non-identical job sizes: A hybrid genetic approach
Kashanl, Ali Husseinzadeh
Karimi, Behrooz
Jolai, Fariborz
[J]. EVOLUTIONARY COMPUTATION IN COMBINATORIAL OPTIMIZATION, PROCEEDINGS, 2006, 3906 : 135 - 146
[3] Minimizing makespan for single machine batch processing with non-identical job sizes using simulated annealing
Melouk, S
Damodaran, P
Chang, PY
[J]. INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS, 2004, 87 (02) : 141 - 147
[4] Minimizing makespan on a batch-processing machine with non-identical job sizes using genetic algorithms
Damodaran, Purushothaman
Manjeshwar, Praveen Kumar
Srihari, Krishnaswami
[J]. INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS, 2006, 103 (02) : 882 - 891
[5] Minimizing Makespan for Single Batch Processing Machine with Non-identical Job Sizes Using a Novel Algorithm: Free Search
Zhang, Ya-ling
Chen, Hua-ping
Shao, Hao
Xu, Rui
[J]. 2009 INTERNATIONAL CONFERENCE ON INFORMATION TECHNOLOGY AND COMPUTER SCIENCE, VOL 1, PROCEEDINGS, 2009, : 179 - 183
[6] Minimizing the makespan on a batch machine with non-identical job sizes: an exact procedure
Dupont, L
Dhaenens-Flipo, C
[J]. COMPUTERS & OPERATIONS RESEARCH, 2002, 29 (07) : 807 - 819
[7] Minimizing makespan for single batch-processing machine with non-identical job sizes using a hybrid DNA Evolutionary Algorithm
Cheng Ba-yi
Chen Hua-ping
Wang Shuan-shi
[J]. PROCEEDINGS OF THE INTERNATIONAL CONFERENCE INFORMATION COMPUTING AND AUTOMATION, VOLS 1-3, 2008, : 749 - 752
[8] Effective hybrid genetic algorithm for minimizing makespan on a single-batch-processing machine with non-identical job sizes
Kashan, A. H.
Karimi, B.
Jolai, F.
[J]. INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 2006, 44 (12) : 2337 - 2360
[9] Minimising makespan on a single batch processing machine with dynamic job arrivals and non-identical job sizes
Zhou, Shengchao
Chen, Huaping
Xu, Rui
Li, Xueping
[J]. INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 2014, 52 (08) : 2258 - 2274
[10] Minimising makespan heuristics for scheduling a single batch machine processing machine with non-identical job sizes
Lee, Yoon Ho
Lee, Young Hoon
[J]. INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 2013, 51 (12) : 3488 - 3500

← 1 2 3 4 5 →