skip to main content
10.1145/1068009.1068275acmconferencesArticle/Chapter ViewAbstractPublication PagesgeccoConference Proceedingsconference-collections
Article

A comparison of messy GA and permutation based GA for job shop scheduling

Published:25 June 2005Publication History

ABSTRACT

This paper presents the results of a fair comparison between a messy GA and a permutation based simple GA as applied to a job shop scheduling system. An examination is made at a macro level in terms of performance and quality of schedules achieved and conclusions are drawn as to the superiority of messy GA or otherwise.

References

  1. www.lancet.mit.edu/ga (accessed 10-January-2005)Google ScholarGoogle Scholar
  2. Dirk Christian Mattfeld, "Evolutionary Search and the Job-Shop: Investigations on Genetic Algorithms for Production Scheduling"1995 Spinger- VerlagGoogle ScholarGoogle Scholar
  3. Dimitri Knjazew "OmeGa: A competent Genetic Algorithm for Solving Permutation and Scheduling Problems" 2001, Kluwer Academic Press. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. Muth, J. F. and Thompson, G. L., eds., Industrial Scheduling, Englewood Cliffs, N. J.: Prentice-Hall, Inc., 1963.Google ScholarGoogle Scholar
  5. ta01-ta80 are from É. D. Taillard (1993), "Benchmarks for basic scheduling problems", European Journal of Operational Research 64, Pages 278--28Google ScholarGoogle ScholarCross RefCross Ref

Index Terms

  1. A comparison of messy GA and permutation based GA for job shop scheduling

    Recommendations

    Comments

    Login options

    Check if you have access through your login credentials or your institution to get full access on this article.

    Sign in
    • Published in

      cover image ACM Conferences
      GECCO '05: Proceedings of the 7th annual conference on Genetic and evolutionary computation
      June 2005
      2272 pages
      ISBN:1595930108
      DOI:10.1145/1068009

      Copyright © 2005 ACM

      Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

      Publisher

      Association for Computing Machinery

      New York, NY, United States

      Publication History

      • Published: 25 June 2005

      Permissions

      Request permissions about this article.

      Request Permissions

      Check for updates

      Qualifiers

      • Article

      Acceptance Rates

      Overall Acceptance Rate1,669of4,410submissions,38%

      Upcoming Conference

      GECCO '24
      Genetic and Evolutionary Computation Conference
      July 14 - 18, 2024
      Melbourne , VIC , Australia

    PDF Format

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader