IDEAS home Printed from https://ideas.repec.org/h/spr/oprchp/978-3-540-32539-0_112.html
   My bibliography  Save this book chapter

Job-Shop Scheduling by GA. A New Crossover Operator

In: Operations Research Proceedings 2005

Author

Listed:
  • Czesław Smutnicki

    (Wrocław University of Technology)

  • Adam Tyński

    (Wrocław University of Technology)

Abstract

Summary The new distance measure between job-shop solutions, based on Euclidean measure, has been proposed. The significant positive correlation of the proposed measure with its suitable version based on the Kendall’s tau measure has been revealed. By applying this measure, a new, easy tunable, crossover quasi-operator for the genetic approach is designed. The genetic algorithm, equipped with the new operator, has been applied to the job-shop scheduling problem with the sum of job completion times criterion. Results provided by the algorithm, compared with the best results known in the literature, confirm superiority of the proposed method.

Suggested Citation

  • Czesław Smutnicki & Adam Tyński, 2006. "Job-Shop Scheduling by GA. A New Crossover Operator," Operations Research Proceedings, in: Hans-Dietrich Haasis & Herbert Kopfer & Jörn Schönberger (ed.), Operations Research Proceedings 2005, pages 715-720, Springer.
  • Handle: RePEc:spr:oprchp:978-3-540-32539-0_112
    DOI: 10.1007/3-540-32539-5_112
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a search for a similarly titled item that would be available.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:oprchp:978-3-540-32539-0_112. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.