Genetic algorithms using multi-objectives(18)

We are interested in a job-shop scheduling problem corresponding to an industrial problem. Gantt diagram’s optimization can be considered as an NP-difficult problem. Determining an optimal solution is almost impossible, but trying to improve the current s

190A.Cardonetal./RoboticsandAutonomousSystems33(2000)179–190

[28]IBMCorporation,IBMAgentBuildingEnvironment

Developer’sToolkit:User’sGuide,IBMIntelligentAgentCenterofCompetence,1997,/iag/iaghome.html.

[29]IBMCorporation,IBMAgentBuildingEnvironment

Developer’sToolkit:ComponentsandAdapterReference,IBMIntelligentAgentCenterofCompetence,1997.

[30]R.Jackendoff,SemanticsandCognition,MITPress,

Cambridge,MA,1983.

[31]N.R.Jennings,K.Sycara,M.Wooldridge,ARoadmap

ofAgentResearchandDevelopment,KluwerAcademicPublishers,Dordrecht,1998.

[32]P.Jorion,PrincipesdesSystèmesIntelligents,Masson,Paris,

1989.

[33]J.Koza,GeneticProgramming,MITPress,Cambridge,MA,

1992,pp.329–355.

[34]my,OrdonnancementetGestiondeProduction,Hermes,

Paris,1987.

[35]ngton,Arti cialLife,Proceedingsofan

InterdisciplinaryWorkshopontheSynthesisandSimulationofLivingSystems,LosAlamos,NM,September,1987,Addison-Wesley,RedwoodCity,CA,1989.

[36]J.LeMoigne,LaModélisationdesSystèmesComplexes,

Dunod,Paris,1990.

[37]K.Mesghouni,S.Hammadi,P.Borne,Productionjob-shop

schedulingusinggeneticalgorithms,in:ProceedingsoftheIEEE/SMC,Information,IntelligenceandSystems,Vol.2,1996,pp.1519–1524.

[38]Z.Michalewicz,GeneticAlgorithms+DataStructures=