TIME-DEPENDENT TRAVELING SALESMAN PROBLEM AND ITS APPLICATION TO TARDINESS PROBLEM IN ONE-MACHINE SCHEDULING

被引：181
|
作者：
PICARD, JC [1 ]
QUEYRANNE, M [1 ]
机构：
[1] ECOLE POLYTECH,MONTREAL H3C 3A7,QUEBEC,CANADA
来源：
OPERATIONS RESEARCH | 1978年 / 26卷 / 01期
关键词：
D O I：
10.1287/opre.26.1.86
中图分类号：
C93 [管理学];
学科分类号：
12 ; 1201 ; 1202 ; 120202 ;
摘要：
引用
收藏
页码：86 / 110
页数：25
相关论文
共 50 条
  • [31] AN IMPROVED ELASTIC NET METHOD WITH TIME-DEPENDENT PARAMETERS FOR TRAVELING SALESMAN PROBLEM
    Yi, Junyan
    Yang, Gang
    Zhang, Zhiqiang
    Tang, Zheng
    INTERNATIONAL JOURNAL OF INNOVATIVE COMPUTING INFORMATION AND CONTROL, 2009, 5 (04): : 1089 - 1100
  • [32] Time-dependent asymmetric traveling salesman problem with time windows: Properties and an exact algorithm
    Arigliano, Anna
    Ghiani, Gianpaolo
    Grieco, Antonio
    Guerriero, Emanuela
    Plana, Isaac
    DISCRETE APPLIED MATHEMATICS, 2019, 261 : 28 - 39
  • [33] Solving Time-Dependent Traveling Salesman Problem with Time Windows with Deep Reinforcement Learning
    Wu, Guojin
    Zhang, Zizhen
    Liu, Hong
    Wang, Jiahai
    2021 IEEE INTERNATIONAL CONFERENCE ON SYSTEMS, MAN, AND CYBERNETICS (SMC), 2021, : 558 - 563
  • [34] One-Machine Scheduling with Time-Dependent Capacity via Efficient Memetic Algorithms
    Mencia, Raul
    Mencia, Carlos
    MATHEMATICS, 2021, 9 (23)
  • [35] Iterated Maximum Large Neighborhood Search for the Traveling Salesman Problem with Time Windows and its Time-dependent Version
    Pralet, Cedric
    COMPUTERS & OPERATIONS RESEARCH, 2023, 150
  • [36] A NEW MULTIPERIOD MULTIPLE TRAVELING SALESMAN PROBLEM WITH HEURISTIC AND APPLICATION TO A SCHEDULING PROBLEM
    GILBERT, KC
    HOFSTRA, RB
    DECISION SCIENCES, 1992, 23 (01) : 250 - 259
  • [37] A LOCALLY OPTIMAL INSERTION HEURISTIC FOR A ONE-MACHINE SCHEDULING PROBLEM
    WERNER, F
    RAIRO-RECHERCHE OPERATIONNELLE-OPERATIONS RESEARCH, 1990, 24 (03): : 255 - 262
  • [38] Revisiting dynamic programming for precedence-constrained traveling salesman problem and its time-dependent generalization
    Salii, Yaroslav
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2019, 272 (01) : 32 - 42
  • [39] The time dependent traveling salesman problem: Polyhedra and algorithm
    Abeledo H.
    Fukasawa R.
    Pessoa A.
    Uchoa E.
    Mathematical Programming Computation, 2013, 5 (01) : 27 - 55
  • [40] A PROCEDURE FOR THE ONE-MACHINE SEQUENCING PROBLEM WITH DEPENDENT JOBS
    DAUZEREPERES, S
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1995, 81 (03) : 579 - 589
12345