Using tabu search to determine the number of kanbans and lotsizes in a generic kanban system
From MaRDI portal
Publication:1385347
DOI10.1023/A:1018950016849zbMATH Open0899.90103OpenAlexW9403874MaRDI QIDQ1385347FDOQ1385347
Authors: A. D. Martin, Te-Min Chang, Yeuhwern Yih, Rex K. Kincaid
Publication date: 26 April 1998
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1018950016849
Recommendations
- Determining the number of kanbans and lotsizes in a generic kanban system: a simulated annealing approach
- Determining the optimal number of Kanban in multi-products supply chain system
- Determination of number of kanbans in a supply chain system via memetic algorithm
- scientific article; zbMATH DE number 744099
- Simultaneously determining the number of kanbans, container sizes, and the final-assembly sequence of products in a just-in-time shop.
- Optimal numbers of two kinds of kanbans in a JIT production system
- A Mathematical Programming Approach to a Deterministic Kanban System
- Determining buffer location and size in production lines using tabu search
Applications of mathematical programming (90C90) Combinatorial optimization (90C27) Production models (90B30)
Cited In (4)
- A comparison of the performance of artificial intelligence techniques for optimizing the number of kanbans
- Evaluating artificial intelligence heuristics for a flexible Kanban system: simultaneous Kanban controlling and scheduling
- Determination of number of kanbans in a supply chain system via memetic algorithm
- Determining the optimal number of Kanban in multi-products supply chain system
This page was built for publication: Using tabu search to determine the number of kanbans and lotsizes in a generic kanban system
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1385347)