Evolution programs for job-shop scheduling

Author

Mesghouni, K. ; Hammadi, S. ; Borne, P.

Author_Institution

Ecole Centrale de Lille, Villeneuve d´´Ascq, France

Volume

1

fYear

1997

fDate

12-15 Oct 1997

Firstpage

720

Abstract

This paper explains how to minimize a makespan of the job shop scheduling problem using evolutionary programs. So the job shop scheduling problem is among the hardest combinatorial problems. Not only is it NP complete but it is one of the worst NP complete class members, but for better performance it is very important to develop an efficient representational scheme and effective genetic operators. Our objective is to improve performance of the evolutionary programs based approach to job-shop scheduling problems by creating a new representation of the chromosome where we integrate the precedence constraint, and the new genetic operators associated with this original representation

Keywords

computational complexity; genetic algorithms; minimisation; production control; NP complete problem; combinatorial problems; efficient representational scheme; evolution programs; genetic operators; job-shop scheduling; makespan minimization; Artificial intelligence; Biological cells; Biology computing; Electronic mail; Evolutionary computation; Genetic algorithms; Job shop scheduling; Processor scheduling; Resource management; Stochastic processes;

fLanguage

English

Publisher

ieee

Conference_Titel

Systems, Man, and Cybernetics, 1997. Computational Cybernetics and Simulation., 1997 IEEE International Conference on

Conference_Location

Orlando, FL

ISSN

1062-922X

Print_ISBN

0-7803-4053-1

Type

conf

DOI

10.1109/ICSMC.1997.625839

Filename

625839