IDEAS home Printed from https://ideas.repec.org/a/ids/injdan/v6y2014i3p275-285.html
   My bibliography  Save this article

A tabu search for the permutation flow shop problem with sequence dependent setup times

Author

Listed:
  • Nicolau Santos
  • Rui Rebelo
  • João Pedro Pedroso

Abstract

In this work we present a tabu search metaheuristic method for solving the permutation flow shop scheduling problem with sequence dependent setup times and the objective of minimising total weighted tardiness. The problem is well known for its practical applications and for the difficulty in obtaining good solutions. The tabu search method proposed is based on the insertion neighbourhood, and is characterised by the selection and evaluation of a small subset of this neighbourhood at each iteration; this has consequences both on diversification and intensification of the search. We also propose a speed-up technique based on book keeping information of the current solution, used for the evaluation of its neighbours.

Suggested Citation

  • Nicolau Santos & Rui Rebelo & João Pedro Pedroso, 2014. "A tabu search for the permutation flow shop problem with sequence dependent setup times," International Journal of Data Analysis Techniques and Strategies, Inderscience Enterprises Ltd, vol. 6(3), pages 275-285.
  • Handle: RePEc:ids:injdan:v:6:y:2014:i:3:p:275-285
    as

    Download full text from publisher

    File URL: http://www.inderscience.com/link.php?id=63062
    Download Restriction: Access to full text is restricted to subscribers.
    ---><---

    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. Allahverdi, Ali, 2015. "The third comprehensive survey on scheduling problems with setup times/costs," European Journal of Operational Research, Elsevier, vol. 246(2), pages 345-378.

    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:ids:injdan:v:6:y:2014:i:3:p:275-285. 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: Sarah Parker (email available below). General contact details of provider: http://www.inderscience.com/browse/index.php?journalID=282 .

    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.