Using tabu search to determine the number of kanbans and lotsizes in a generic kanban system
Andrew Martin,
Te-Min Chang,
Yeuhwern Yih and
Rex Kincaid
Annals of Operations Research, 1998, vol. 78, issue 0, 217 pages
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
Date: 1998
References: Add references at CitEc
Citations: View citations in EconPapers (1)
Downloads: (external link)
http://hdl.handle.net/10.1023/A:1018950016849 (text/html)
Access to full text is restricted to subscribers.
Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.
Export reference: BibTeX
RIS (EndNote, ProCite, RefMan)
HTML/Text
Persistent link: https://EconPapers.repec.org/RePEc:spr:annopr:v:78:y:1998:i:0:p:201-217:10.1023/a:1018950016849
Ordering information: This journal article can be ordered from
http://www.springer.com/journal/10479
DOI: 10.1023/A:1018950016849
Access Statistics for this article
Annals of Operations Research is currently edited by Endre Boros
More articles in Annals of Operations Research from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().