An application of immune algorithms for job-shop scheduling problems

Author

Miyashita, Tomoyuki

Author_Institution

Dept. of Syst. Eng., Ibaraki Univ., Nakanarusawa, Japan

fYear

2003

Firstpage

146

Lastpage

150

Abstract

Job-shop scheduling problems (JSSPs) are important problems that decide production scheduling. However these problems are not easy to solve and many studies have been done. Furthermore, in real situation, while doing jobs according to decided schedule, re-scheduling occurs because of new jobs and it is required to decide the schedule considering ability and skills of works. In this study, in the stage of the deciding the JSSPs, we will discuss the method to offer the designer several candidates of the JSP and then designers can select the final schedule considering the difficult properties to formulate the problems. Through some numerical examples, we will confirm the effectiveness of the proposed method.

Keywords

genetic algorithms; job shop scheduling; production planning; final schedule; genetic algorithms; immune algorithms; job shop scheduling; production scheduling; re-scheduling; work skills; Genetic algorithms; Immune system; Job production systems; Machine tools; Process design; Production facilities; Production planning; Production systems; Scheduling algorithm; Systems engineering and theory;

fLanguage

English

Publisher

ieee

Conference_Titel

Assembly and Task Planning, 2003. Proceedings of the IEEE International Symposium on

Print_ISBN

0-7803-7770-2

Type

conf

DOI

10.1109/ISATP.2003.1217202

Filename

1217202