IDEAS home Printed from https://ideas.repec.org/a/inm/oropre/v26y1978i1p86-110.html
   My bibliography  Save this article

The Time-Dependent Traveling Salesman Problem and Its Application to the Tardiness Problem in One-Machine Scheduling

Author

Listed:
  • Jean-Claude Picard

    (Federal University of Paraiba, Campina Grande, Brazil)

  • Maurice Queyranne

    (Ecole Polytechnique, Montreal, Quebec)

Abstract

The time-dependent traveling salesman problem may be stated as a scheduling problem in which n jobs have to be processed at minimum cost on a single machine. The set-up cost associated with each job depends not only on the job that precedes it, but also on its position (time) in the sequence. The optimization method described here combines finding shortest paths in an associated multipartite network with subgradient optimization and some branch-and-bound enumeration. Minimizing the tardiness costs in one-machine scheduling (in which the cost is a non-decreasing function of the completion time of each job) is then attacked by this method. A branch-and-bound algorithm is designed for this problem. It uses a related time-dependent traveling salesman problem to compute the required lower bounds. We give computational results for the weighted tardiness problem.

Suggested Citation

  • Jean-Claude Picard & Maurice Queyranne, 1978. "The Time-Dependent Traveling Salesman Problem and Its Application to the Tardiness Problem in One-Machine Scheduling," Operations Research, INFORMS, vol. 26(1), pages 86-110, February.
    • Handle: RePEc:inm:oropre:v:26:y:1978:i:1:p:86-110
    DOI: 10.1287/opre.26.1.86
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.26.1.86
    Download Restriction: no
    File URL: https://libkey.io/10.1287/opre.26.1.86?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:inm:oropre:v:26:y:1978:i:1:p:86-110. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.