Skip to main content

2003 | OriginalPaper | Buchkapitel

Performance Evaluation of a Parameter-Free Genetic Algorithm for Job-Shop Scheduling Problems

verfasst von : Shouichi Matsui, Isamu Watanabe, Ken-ichi Tokoro

Erschienen in: Genetic and Evolutionary Computation — GECCO 2003

Verlag: Springer Berlin Heidelberg

Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.

search-config
loading …

The job-shop scheduling problem (JSSP) is well known as one of the most difficult NP-hard combinatorial optimization problems. Genetic Algorithms (GAs) for solving the JSSP have been proposed, and they perform well compared with other approaches [1].

Metadaten
Titel
Performance Evaluation of a Parameter-Free Genetic Algorithm for Job-Shop Scheduling Problems
verfasst von
Shouichi Matsui
Isamu Watanabe
Ken-ichi Tokoro
Copyright-Jahr
2003
Verlag
Springer Berlin Heidelberg
DOI
https://doi.org/10.1007/3-540-45110-2_43

Neuer Inhalt