Abstract
This paper discusses the use of modern heuristic techniques coupled with a simulation model of a Just in Time system to find the optimum number of kanbans while minimizing cost. Three simulation search heuristic procedures based on Genetic Algorithms, Simulated Annealing, and Tabu Search are developed and compared both with respect to the best results achieved by each algorithm in a limited time span and their speed of convergence to the results. In addition, a Neural Network metamodel is developed and compared with the heuristic procedures according to the best results. The results indicate that Tabu Search performs better than the other heuristics and Neural Network metamodel in terms of computational effort.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
