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 条
  • [21] AN N-CONSTRAINT FORMULATION OF THE (TIME-DEPENDENT) TRAVELING SALESMAN PROBLEM
    FOX, KR
    GAVISH, B
    GRAVES, SC
    OPERATIONS RESEARCH, 1980, 28 (04) : 1018 - 1021
  • [22] Dynamic open time-dependent traveling salesman problem with speed optimization
    Cimen, Mustafa
    Soysal, Mehmet
    Belbag, Sedat
    Kazanc, Hande Cansin
    INTERNATIONAL TRANSACTIONS IN OPERATIONAL RESEARCH, 2024,
  • [23] An integer programming approach for the time-dependent traveling salesman problem with time windows
    Montero, Agustin
    Mendez-Diaz, Isabel
    Jose Miranda-Bront, Juan
    COMPUTERS & OPERATIONS RESEARCH, 2017, 88 : 280 - 289
  • [24] A Neighborhood Search Algorithm for One-machine Scheduling Problem with Time Lags
    Zhao Ruiguo
    Li Jiejia
    CCDC 2009: 21ST CHINESE CONTROL AND DECISION CONFERENCE, VOLS 1-6, PROCEEDINGS, 2009, : 1937 - +
  • [25] Augmentations of consistent partial orders for the one-machine total tardiness problem
    Yu, WC
    DISCRETE APPLIED MATHEMATICS, 1996, 68 (1-2) : 189 - 202
  • [26] Solving the time dependent traveling salesman problem
    Li, FY
    Golden, B
    Wasil, E
    NEXT WAVE IN COMPUTING, OPTIMIZATION, AND DECISION TECHNOLOGIES, 2005, 29 : 163 - 182
  • [27] Augmentations of consistent partial orders for the one-machine total tardiness problem
    Institute of Applied Mathematics, E. China Univ. of Sci. and Technol., 130 Meiling Road, Shanghai 200237, China
    Discrete Appl Math, 1-2 (189-202):
  • [28] THE ONE-MACHINE SEQUENCING PROBLEM WITH DEPENDENT JOBS
    DAUZEREPERES, S
    COMPUTERS & INDUSTRIAL ENGINEERING, 1993, 25 (1-4) : 235 - 238
  • [29] Time-Dependent Travelling Salesman Problem
    V. Bhavani
    M. Sundara Murthy
    OPSEARCH, 2005, 42 (3) : 199 - 227
  • [30] Dynamic Discretization Discovery for Solving the Time-Dependent Traveling Salesman Problem with Time Windows
    Duc Minh Vu
    Hewitt, Mike
    Boland, Natashia
    Savelsbergh, Martin
    TRANSPORTATION SCIENCE, 2020, 54 (03) : 703 - 720
12345