Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Determination of number of kanbans in a supply chain system via memetic algorithm

From MaRDI portal
Publication:1009927
Jump to:navigation, search

DOI10.1016/j.advengsoft.2008.07.001zbMath1157.90540OpenAlexW1969640339MaRDI QIDQ1009927

J. Martínez

Publication date: 3 April 2009

Published in: Advances in Engineering Software (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.advengsoft.2008.07.001


zbMATH Keywords

heuristicmemetic algorithmkanbanmixed integer non-linear programming (MINLP)supply chain system (SCS)


Mathematics Subject Classification ID

Mixed integer programming (90C11) Nonlinear programming (90C30) Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59)


Related Items (2)

A memetic algorithm for minimizing the total weighted completion time on a single machine under step-deterioration ⋮ Determining the optimal number of Kanban in multi-products supply chain system



Cites Work

  • Optimal models for a multi-stage supply chain system controlled by kanban under just-in-time philosophy
  • Push and Pull Production Systems: Issues and Comparisons
  • Operations planning for a single-stage kanban system operating under linear demand




This page was built for publication: Determination of number of kanbans in a supply chain system via memetic algorithm

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1009927&oldid=13004018"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 30 January 2024, at 21:11.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki