Title of article
Heuristics for the traveling salesman problem with pickup and delivery
Author/Authors
Michel Gendreau، نويسنده , , Gilbert Laporte، نويسنده , , Daniele Vigo، نويسنده ,
Issue Information
دوهفته نامه با شماره پیاپی سال 1999
Pages
16
From page
699
To page
714
Abstract
The problem of interest is to schedule two types of jobs on a two-stage flowshop with a common second-stage machine so as to minimize the makespan. This problem was previously known to be View the MathML source-hard in the ordinary sense. In this note, we give a proof for the strong View the MathML source-hardness.
Keywords
Heuristics , Pickup and delivery , Tabu search , Traveling salesman problem
Journal title
Computers and Operations Research
Serial Year
1999
Journal title
Computers and Operations Research
Record number
927029
Link To Document