文章基本信息

标题：MILP for the Inventory and Routing for Replenishment Problem in the Car Assembly Line.
本地全文：下载
作者：Raul Pulido ; Álvaro Garcia-Sánchez ; Miguel Ortega-Mier 等
期刊名称：International Journal of Production Management and Engineering
印刷版ISSN：2340-4876
出版年度：2014
卷号：2
期号：1
页码：37-45
DOI：10.4995/ijpme.2014.1838
语种：English
出版社：Universitat Politècnica de València
摘要：The inbound logistic for feeding the workstation inside the factory represents a critical issue in the car manufacturing industry. Nowadays, this issue is even more critical than in the past since more types of car are being produced in the assembly lines. Consequently, as workstations have to install many types of components, they also need to have an inventory of different types of the component in a compact space. The replenishment is a critical issue since a lack of inventory could cause line stoppage or reworking. On the other hand, an excess of inventory could increase the holding cost or even block the replenishment paths. The decision of the replenishment routes cannot be made without taking into consideration the inventory needed by each station during the production time which will depend on the production sequence. This problem deals with medium-sized instances and it is solved using online solvers. The contribution of this paper is a MILP for the replenishment and inventory of the components in a car assembly line.
其他摘要：The inbound logistic for feeding the workstation inside the factory represents a critical issue in the car manufacturing industry. Nowadays, this issue is even more critical than in the past since more types of car are being produced in the assembly lines. Consequently, as workstations have to install many types of components, they also need to have an inventory of different types of the component in a compact space. The replenishment is a critical issue since a lack of inventory could cause line stoppage or reworking. On the other hand, an excess of inventory could increase the holding cost or even block the replenishment paths. The decision of the replenishment routes cannot be made without taking into consideration the inventory needed by each station during the production time which will depend on the production sequence. This problem deals with medium-sized instances and it is solved using online solvers. The contribution of this paper is a MILP for the replenishment and inventory of the components in a car assembly line.
关键词：Integer Programming;Routing;Inventory;Assembly line
其他关键词：Integer Programming↓Routing↓Inventory↓Assembly line