MILP for the inventory and routing problem for replenishment the car assembly line

被引:0
|
作者
Pulido, R. [1 ,2 ]
Garcia-Sanchez, A. [1 ]
Ortega-Mier, M. A. [1 ]
Brun, A. [2 ]
机构
[1] UPM, Escuela Tecn Super Ingenieros Ind, Jose Gutierrez Abascal 2, Madrid 28006, Spain
[2] Politecn Milan, Dipartimento Ingn Gestionale, Milan, Italy
关键词
Integer Programming; Routing; Inventory; Assembly line;
D O I
10.4995/ijpme.2014.1838
中图分类号
T [工业技术];
学科分类号
08 ;
摘要
The inbound logistics 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 cars 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 components in a usually compact space. The replenishment of inventory is a critical issue since a lack of it could cause line stoppage or reprocessing. 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 in each station during the production time, which will depend on the production, sequence plan sent by the central office. This problem deals with medium-sized instances and it is solved using online solvers. The contribution of this paper is a MILP model for the replenishment and inventory of the components in a car assembly line.
引用
收藏
页码:37 / 45
页数:9
相关论文
共 50 条
  • [1] Inventory routing in a warehouse: The storage replenishment routing problem
    Celik, Melih
    Archetti, Claudia
    Sural, Haldun
    [J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2022, 301 (03) : 1117 - 1132
  • [2] CAR: heuristics for the inventory routing problem
    Nambirajan, Ramkumar
    Mendoza, Abraham
    Pazhani, Subramanian
    Narendran, T. T.
    Ganesh, K.
    [J]. WIRELESS NETWORKS, 2020, 26 (08) : 5783 - 5808
  • [3] CAR: heuristics for the inventory routing problem
    Ramkumar Nambirajan
    Abraham Mendoza
    Subramanian Pazhani
    T. T. Narendran
    K. Ganesh
    [J]. Wireless Networks, 2020, 26 : 5783 - 5808
  • [4] Robust Inventory Routing Problem with Replenishment Lead Time
    Zheng, Weibo
    Zhou, Hong
    [J]. 2019 IEEE INTERNATIONAL CONFERENCE ON INDUSTRIAL ENGINEERING AND ENGINEERING MANAGEMENT (IEEM), 2019, : 825 - 829
  • [5] Robustness of inventory replenishment and customer selection policies for the dynamic and stochastic inventory-routing problem
    Roldan, Raul F.
    Basagoiti, Rosa
    Coelho, Leandro C.
    [J]. COMPUTERS & OPERATIONS RESEARCH, 2016, 74 : 14 - 20
  • [6] PERIOD AND PHASE OF CUSTOMER REPLENISHMENT - A NEW APPROACH TO THE STRATEGIC INVENTORY/ROUTING PROBLEM
    WEBB, IR
    LARSON, RC
    [J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1995, 85 (01) : 132 - 148
  • [7] Integrated problem of car sequencing and vehicle routing on an automotive mixed-model assembly line
    Chen, Jian
    Zhou, Hong
    Xue, Qiang
    Xie, Naiming
    Sang, Yao-Wen
    [J]. Computers and Industrial Engineering, 2025, 199
  • [8] A MILP model for the Accessibility Windows Assembly Line Balancing Problem (AWALBP)
    Calleja, Gema
    Corominas, Albert
    Garcia-Villoria, Alberto
    Pastor, Rafael
    [J]. INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 2013, 51 (12) : 3549 - 3560
  • [9] An Inventory-Routing Problem with Pickups and Deliveries Arising in the Replenishment of Automated Teller Machines
    van Anholt, Roel G.
    Coelho, Leandro C.
    Laporte, Gilbert
    Vis, Iris F. A.
    [J]. TRANSPORTATION SCIENCE, 2016, 50 (03) : 1077 - 1091
  • [10] THE INVENTORY REPLENISHMENT POLICY IN AN UNCERTAIN PRODUCTION-INVENTORY-ROUTING SYSTEM
    Wang, Chenyin
    Ni, Yaodong
    Yang, Xiangfeng
    [J]. JOURNAL OF INDUSTRIAL AND MANAGEMENT OPTIMIZATION, 2023, 19 (01) : 549 - 572