An empirical performance evaluation of a parameter-free genetic algorithm for job-shop scheduling problem

The Job-Shop Scheduling Problem (JSSP) is well known as one of the most difficult NP-hard combinatorial optimization problems. Several GA-based approaches have been reported for the JSSP. Among them, there is a parameter-free genetic algorithm (PfGA) for JSSP proposed by Matsui et al., based on an e...

Celý popis

Podrobná bibliografia

Vydané v:	2007 IEEE Congress on Evolutionary Computation s. 3796 - 3803
Hlavní autori:	Matsui, S., Yamada, S.
Médium:	Konferenčný príspevok..
Jazyk:	English Japanese
Vydavateľské údaje:	IEEE 01.09.2007
Predmet:	Algorithm design and analysis Biological cells Decoding Design engineering Genetic algorithms History Job shop scheduling Power engineering and energy Production Simulated annealing
ISBN:	1424413397, 9781424413393
ISSN:	1089-778X
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!