A Fast 4-Approximation Algorithm for the Traveling Repairman Problem on a Line

被引：0
|
作者：
Perez Perez, S. L. [1 ,3 ]
Urban Riverol, L. E. [1 ]
Lopez Bracho, R. [2 ]
Zaragoza Martinez, F. J. [2 ]
机构：
[1] UAM Azcapotzalco, Posgrad Optimizac, Mexico City, DF, Mexico
[2] UAM Azcapotzalco, Dept Sistemas, Mexico City, DF, Mexico
[3] UAM Cuajimalpa, Dept Tecnol Informac, Mexico City, DF, Mexico
来源：
2014 11TH INTERNATIONAL CONFERENCE ON ELECTRICAL ENGINEERING, COMPUTING SCIENCE AND AUTOMATIC CONTROL (CCE) | 2014年
关键词：
Traveling repairman problem; scheduling problem; unit time windows; approximation algorithm; SPEEDING DELIVERYMAN PROBLEMS; TIME WINDOWS; APPROXIMATION ALGORITHMS; SALESMAN;
D O I：
暂无
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
The traveling repairman problem is a scheduling problem in which a repairman is supposed to visit some customers at their locations to perform some jobs. Each customer has a time window during which the repairman is allowed to arrive to perform the jobs. The goal is to maximize the number of visited locations. In this work we deal with a special case in which the locations are on a line, the processing time of each job is zero, and the time window length is unitary. Although the general TRP is NP-Hard, the complexity of this special case remains unknown. We introduce a quadratic 4-approximation algorithm based on the 8-approximation algorithm proposed in 2005 by R. Bar-Yehuda, G. Even, and S. Shahar.
引用
收藏
页数：4
相关论文
共 50 条
  • [21] An approximation algorithm for the traveling tournament problem
    Ryuhei Miyashiro
    Tomomi Matsui
    Shinji Imahori
    Annals of Operations Research, 2012, 194 : 317 - 324
  • [22] An approximation algorithm for the traveling tournament problem
    Miyashiro, Ryuhei
    Matsui, Tomomi
    Imahori, Shinji
    ANNALS OF OPERATIONS RESEARCH, 2012, 194 (01) : 317 - 324
  • [23] A 4-approximation algorithm for guarding 1.5-dimensional terrains
    King, J
    LATIN 2006: THEORETICAL INFORMATICS, 2006, 3887 : 629 - 640
  • [24] A 5/4-approximation algorithm for scheduling identical malleable tasks
    Decker, T.
    Luecking, T.
    Monien, B.
    THEORETICAL COMPUTER SCIENCE, 2006, 361 (2-3) : 226 - 240
  • [25] A 5/4-approximation algorithm for scheduling identical malleable tasks
    Decker, T
    Lücking, T
    Monien, B
    APPROXIMATION AND ONLINE ALGORITHMS, 2004, 2909 : 95 - 108
  • [26] A New Mathematical Model for the Traveling Repairman Problem
    Naeni, L. M.
    Salehipour, A.
    2019 IEEE INTERNATIONAL CONFERENCE ON INDUSTRIAL ENGINEERING AND ENGINEERING MANAGEMENT (IEEM), 2019, : 1384 - 1387
  • [27] Approximation Algorithms for the Traveling Repairman and Speeding Deliveryman Problems
    Frederickson, Greg N.
    Wittman, Barry
    ALGORITHMICA, 2012, 62 (3-4) : 1198 - 1221
  • [28] A 4/5-Approximation Algorithm for the Maximum Traveling Salesman Problem
    Dudycz, Szymon
    Marcinkowski, Jan
    Paluch, Katarzyna
    Rybicki, Bartosz
    INTEGER PROGRAMMING AND COMBINATORIAL OPTIMIZATION, IPCO 2017, 2017, 10328 : 173 - 185
  • [29] Metaheuristic for the Capacitated Multiple Traveling Repairman Problem
    Khanh-Phuong Nguyen
    Ha-Bang Ban
    INTERNATIONAL JOURNAL OF ADVANCED COMPUTER SCIENCE AND APPLICATIONS, 2020, 11 (05) : 377 - 384
  • [30] Approximation Algorithms for the Traveling Repairman and Speeding Deliveryman Problems
    Greg N. Frederickson
    Barry Wittman
    Algorithmica, 2012, 62 : 1198 - 1221
12345