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

Author

Shao, Hao ; Chen, Hua-Ping ; Xu, Rui ; Zhang, Wen-Gong

Author_Institution

Dept. of Inf. Manage. & Decision Sci., Univ. of Sci. & Technol. of China, Hefei

Volume

6

fYear

2008

fDate

18-20 Oct. 2008

Firstpage

511

Lastpage

514

Abstract

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.

Keywords

matrix algebra; minimisation; neural nets; scheduling; combinatorial optimization problem; makespan minimization; master weight matrix; neural nets approach; nonidentical job size; single batch processing machine; Circuit testing; Genetic algorithms; Heuristic algorithms; Hopfield neural networks; Information management; Job shop scheduling; Machine intelligence; Neural networks; Optimization methods; Simulated annealing;

fLanguage

English

Publisher

ieee

Conference_Titel

Natural Computation, 2008. ICNC '08. Fourth International Conference on

Conference_Location

Jinan

Print_ISBN

978-0-7695-3304-9

Type

conf

DOI

10.1109/ICNC.2008.368

Filename

4667889