Cart (Loading....) | Create Account
Close category search window
 

The optimization of number of kanbans with genetic algorithms, simulated annealing and tabu search

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Alabas, C. ; Dept. of Ind. Eng., Gazi Univ., Ankara, Turkey ; Altiparmak, F. ; Dengiz, B.

In this paper, three simulation search heuristic procedures, based on genetic algorithms, simulated annealing and tabu search, respectively, were developed and compared (both with respect to the best results achieved by each algorithm in a limited time span and to their speed of convergence) to the results for finding the optimum number of kanbans while minimizing the cost in a just-in-time manufacturing system

Published in:

Evolutionary Computation, 2000. Proceedings of the 2000 Congress on  (Volume:1 )

Date of Conference:

2000

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.