Skip to main content
Disciplines
Automotive Business IT + Informatics Construction + Real Estate Electrical Engineering + Electronics Energy + Sustainability Insurance + Risk Finance + Banking Management + Leadership Marketing + Sales Mechanical Engineering + Materials
Events
DE
EN
Books
Journals
Topic Page
Marketing
Start single access now
Access for companies
EXTENDED SEARCH
Log in
Top
Published in:
Design of Multithreaded Estimation of Distribution Algorithms Read chapter Read first chapter

2003 | OriginalPaper | Chapter

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

Authors : Shouichi Matsui, Isamu Watanabe, Ken-ichi Tokoro

Published in: Genetic and Evolutionary Computation — GECCO 2003

Publisher: Springer Berlin Heidelberg

Included in: Professional Book Archive

Get Access

Activate our intelligent search to find suitable subject content or patents.

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

previous chapter A Fixed-Length Subset Genetic Algorithm for the p-Median Problem
next chapter SEPA: Structure Evolution and Parameter Adaptation in Feed-Forward Neural Networks
Metadata
Title
Performance Evaluation of a Parameter-Free Genetic Algorithm for Job-Shop Scheduling Problems
Authors
Shouichi Matsui
Isamu Watanabe
Ken-ichi Tokoro
Copyright Year
2003
Publisher
Springer Berlin Heidelberg
Book
Genetic and Evolutionary Computation — GECCO 2003

Print ISBN: 978-3-540-40603-7

Electronic ISBN: 978-3-540-45110-5

Copyright Year: 2003

DOI
https://doi.org/10.1007/3-540-45110-2_43