Determining the number of kanbans and lotsizes in a generic kanban system: a simulated annealing approach

DOI10.1080/00207549408957054zbMath0896.90113OpenAlexW2092828986MaRDI QIDQ4394329

Te-Min Chang, Yeuhwern Yih

Publication date: 1 October 1998

Published in: International Journal of Production Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207549408957054

zbMATH Keywords

simulated annealingkanban systemnon-repetitive manufacturing

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Production models (90B30) Combinatorial optimization (90C27)

Related Items (1)

Metaheuristics: A bibliography

Cites Work

• Unnamed Item
• Optimization by Simulated Annealing
• Thermodynamical approach to the travelling salesman problem: An efficient simulation algorithm
• The application of the simulated annealing algorithm to the solution of the \(n/m/C_{\max}\) flowshop problem
• Simulated annealing: A tool for operational research
• New approaches for heuristic search: A bilateral linkage with artificial intelligence
• Cooling Schedules for Optimal Annealing
• Generic kanban systems for dynamic environments

This page was built for publication: Determining the number of kanbans and lotsizes in a generic kanban system: a simulated annealing approach