Integer linear programming formulation of the vehicle positioning problem in automated manufacturing systems

被引:5
|
作者
Montoya-Torres, Jairo R. [1 ]
Onate Bello, Gonzalo [1 ]
机构
[1] Univ La Sabana, Escuela Int Ciencias Econ & Adm, Chia, Cundinamarca, Colombia
关键词
Vehicle location; Integer linear programming; Automated manufacturing; IC semiconductors; Simulation; GUIDED VEHICLES; LOOP LAYOUT; RESPONSE-TIME; DESIGN;
D O I
10.1007/s10845-009-0316-4
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
This paper addresses the problem of vehicle location (positioning) for automated transport in fully automated manufacturing systems. This study is motivated by the complexity of vehicle control found in modern integrated circuit semiconductor fabrication facilities where the material handling network path is composed of multiple loops interconnected. In order to contribute to decrease the manufacturing lead-time of semiconductor products, we propose an integer linear program that minimizes the maximum time needed to serve a transport request. Computation experiments are based on real-life data. We discuss the practical usefulness of the mathematical model by means of a simulation experiment used to analyze the factory operational behavior.
引用
收藏
页码:545 / 552
页数:8
相关论文
共 50 条
  • [1] Integer linear programming formulation of the vehicle positioning problem in automated manufacturing systems
    Jairo R. Montoya-Torres
    Gonzalo Oñate Bello
    Journal of Intelligent Manufacturing, 2011, 22 : 545 - 552
  • [2] INTEGER LINEAR-PROGRAMMING FORMULATION FOR A VEHICLE-ROUTING PROBLEM
    ACHUTHAN, NR
    CACCETTA, L
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1991, 52 (01) : 86 - 89
  • [3] A mixed integer linear programming formulation for the vehicle routing problem with backhauls
    Granada-Echeverri, Mauricio
    Toro, Eliana M.
    Santa, Jhon Jairo
    INTERNATIONAL JOURNAL OF INDUSTRIAL ENGINEERING COMPUTATIONS, 2019, 10 (02) : 295 - 308
  • [4] An Integer Linear Programming Formulation for the Minimum Cardinality Segmentation Problem
    Catanzaro, Daniele
    Engelbeen, Celine
    ALGORITHMS, 2015, 8 (04): : 999 - 1020
  • [5] PARAMETRIC FORMULATION OF THE GENERAL INTEGER LINEAR-PROGRAMMING PROBLEM
    JOSEPH, A
    COMPUTERS & OPERATIONS RESEARCH, 1995, 22 (09) : 883 - 892
  • [6] A new integer linear programming formulation for the problem of political districting
    Djordje Dugošija
    Aleksandar Savić
    Zoran Maksimović
    Annals of Operations Research, 2020, 288 : 247 - 263
  • [7] A mixed integer linear programming formulation of the maximum betweenness problem
    Savic, Aleksandar
    Kratica, Jozef
    Milanovic, Marija
    Dugosija, Djordje
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2010, 206 (03) : 522 - 527
  • [8] Mixed Integer Linear Programming Formulation for the Taxi Sharing Problem
    Ben-Smida, Houssem E.
    Krichen, Saoussen
    Chicano, Francisco
    Alba, Enrique
    SMART CITIES, SMART-CT 2016, 2016, 9704 : 106 - 117
  • [9] A new integer linear programming formulation for the problem of political districting
    Dugosija, Djordje
    Savic, Aleksandar
    Maksimovic, Zoran
    ANNALS OF OPERATIONS RESEARCH, 2020, 288 (01) : 247 - 263
  • [10] INTEGER LINEAR-PROGRAMMING FORMULATION FOR VEHICLE-ROUTING PROBLEMS
    BRODIE, GR
    WATERS, CDJ
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1988, 34 (03) : 403 - 404