IDEAS home Printed from https://ideas.repec.org/a/spr/annopr/v78y1998i0p201-21710.1023-a1018950016849.html
   My bibliography  Save this article

Using tabu search to determine the number of kanbans and lotsizes in a generic kanban system

Author

Listed:
  • Andrew Martin
  • Te-Min Chang
  • Yeuhwern Yih
  • Rex Kincaid

Abstract

A generic kanban system designed for non-repetitive manufacturing environments is described. The purpose of this paper is to determine the number of kanbans and lotsizes to maximize system performance. System objectives include minimizing cycle time, operation costs and capital losses. A scalar multi-attribute utility function is constructed and a tabu search algorithm is proposed to search for the optimal utility value. Simulation is used to generate objective function values for each system setup. Four different variations of tabu search are employed. It is shown that a random sampling of the neighborhood provides good results with the shortest computation time. The tabu search algorithm proposed performs much better than a local search. The results are then compared to those from a modified simulated annealing algorithm. Due to the planar nature of the objective function, it is shown that tabu search can provide excellent results, yet a simulated annealing approach provides the same results with better computation time. Copyright Kluwer Academic Publishers 1998

Suggested Citation

  • Andrew Martin & Te-Min Chang & Yeuhwern Yih & Rex Kincaid, 1998. "Using tabu search to determine the number of kanbans and lotsizes in a generic kanban system," Annals of Operations Research, Springer, vol. 78(0), pages 201-217, January.
    • Handle: RePEc:spr:annopr:v:78:y:1998:i:0:p:201-217:10.1023/a:1018950016849
    DOI: 10.1023/A:1018950016849
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1023/A:1018950016849
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1023/A:1018950016849?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. Hachicha, Wafik & Ammeri, Ahmed & Masmoudi, Faouzi & Chachoub, Habib, 2010. "A comprehensive literature classification of simulation optimisation methods," MPRA Paper 27652, University Library of Munich, Germany.

    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:spr:annopr:v:78:y:1998:i:0:p:201-217:10.1023/a:1018950016849. 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.