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...

Full description

Saved in:

Bibliographic Details
Published in:	2007 IEEE Congress on Evolutionary Computation pp. 3796 - 3803
Main Authors:	Matsui, S., Yamada, S.
Format:	Conference Proceeding
Language:	English Japanese
Published:	IEEE 01.09.2007
Subjects:	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
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!