IDEAS home Printed from https://ideas.repec.org/a/taf/tprsxx/v54y2016i16p4793-4804.html
   My bibliography  Save this article

A shuffled frog-leaping algorithm for job shop scheduling with outsourcing options

Author

Listed:
  • Deming Lei
  • Xiuping Guo

Abstract

In this paper, job shop scheduling problem with outsourcing options is considered and a novel shuffled frog-leaping algorithm (SFLA) is presented to minimise total tardiness under condition that total outsourcing cost does not exceed a given upper bound. In SFLA, a tournament selection-based method is used to decompose the whole population into some memeplexes, the search process in each memeplex is done on the best solution of the memeplex and composed of the global search step and the multiple neighbourhood search step. SFLA is tested on a number of instances and compared with some methods from the literature. Computational results validate the promising performance of SFLA on the considered problem.

Suggested Citation

  • Deming Lei & Xiuping Guo, 2016. "A shuffled frog-leaping algorithm for job shop scheduling with outsourcing options," International Journal of Production Research, Taylor & Francis Journals, vol. 54(16), pages 4793-4804, August.
    • Handle: RePEc:taf:tprsxx:v:54:y:2016:i:16:p:4793-4804
    DOI: 10.1080/00207543.2015.1088970
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/00207543.2015.1088970
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1080/00207543.2015.1088970?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. Min Kong & Xinbao Liu & Jun Pei & Panos M. Pardalos & Nenad Mladenovic, 2020. "Parallel-batching scheduling with nonlinear processing times on a single and unrelated parallel machines," Journal of Global Optimization, Springer, vol. 78(4), pages 693-715, December.

    More about this item

    Statistics

    Access and download statistics

    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:taf:tprsxx:v:54:y:2016:i:16:p:4793-4804. 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: Chris Longhurst (email available below). General contact details of provider: http://www.tandfonline.com/TPRS20 .

    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.