IDEAS home Printed from https://ideas.repec.org/a/wsi/apjorx/v27y2010i06ns021759591000296x.html
   My bibliography  Save this article

A Hybrid Permutation-Coded Evolutionary Algorithm For The Early/Tardy Scheduling Problem

Author

Listed:
  • ALOK SINGH

    (Department of Computer and Information Sciences, School of Mathematics and Computer/Information Sciences, University of Hyderabad, Hyderabad — 500046, Andhra Pradesh, India)

Abstract

In this paper, we have proposed a hybrid permutation-coded steady-state genetic algorithm for a single machine scheduling problem with earliness and tardiness costs and no machine idle time. The steady-state genetic algorithm generates schedules, which are further improved by successive applications of an adjacent pairwise interchange procedure. We have compared our approach against the best approaches reported in the literature. Computational results show the effectiveness of our approach, since it obtained better quality solutions in shorter time.

Suggested Citation

  • Alok Singh, 2010. "A Hybrid Permutation-Coded Evolutionary Algorithm For The Early/Tardy Scheduling Problem," Asia-Pacific Journal of Operational Research (APJOR), World Scientific Publishing Co. Pte. Ltd., vol. 27(06), pages 713-725.
    • Handle: RePEc:wsi:apjorx:v:27:y:2010:i:06:n:s021759591000296x
    DOI: 10.1142/S021759591000296X
    as

    Download full text from publisher

    File URL: http://www.worldscientific.com/doi/abs/10.1142/S021759591000296X
    Download Restriction: Access to full text is restricted to subscribers
    File URL: https://libkey.io/10.1142/S021759591000296X?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Tan, Zhen & Fu, Guanqi, 2024. "Just-in-time scheduling problem with affine idleness cost," European Journal of Operational Research, Elsevier, vol. 313(3), pages 954-976.

    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:wsi:apjorx:v:27:y:2010:i:06:n:s021759591000296x. 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: Tai Tone Lim (email available below). General contact details of provider: http://www.worldscinet.com/apjor/apjor.shtml .

    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.