Module type genetic algorithm for modified scheduling problems with worker allocation

Author

Iima, Hitoshi ; Sannomiya, Nobuo

Author_Institution

Dept. of Electron. & Inf. Sci., Kyoto Inst. of Technol., Japan

Volume

2

fYear

2001

fDate

2001

Firstpage

856

Abstract

This paper deals with modified scheduling problems in manufacturing systems. Recently optimization is required for not only basic scheduling problems but also scheduling problems modified in such a way that some constraints are added to them. Genetic algorithm (GA) is considered to be a promising method for solving the modified scheduling problems, because the degree of the change of procedures is small for the modification. In GA the problems can be solved by only adding a module related to the added constraints. In this paper, a concept of module type GA (MTGA) based on this idea is proposed, and a design of MTGA is proposed for solving modified scheduling problems with the worker allocation. The effectiveness of the proposed algorithm is investigated through a numerical result for a job-shop scheduling problem

Keywords

genetic algorithms; production control; resource allocation; GA; MTGA; job-shop scheduling problem; manufacturing systems; modified scheduling problems; module type genetic algorithm; worker allocation; Biological cells; Constraint optimization; Decoding; Genetic algorithms; Information science; Job shop scheduling; Manufacturing industries; Manufacturing systems; Processor scheduling; Scheduling algorithm;

fLanguage

English

Publisher

ieee

Conference_Titel

American Control Conference, 2001. Proceedings of the 2001

Conference_Location

Arlington, VA

ISSN

0743-1619

Print_ISBN

0-7803-6495-3

Type

conf

DOI

10.1109/ACC.2001.945824

Filename

945824