The time-dependent traveling salesman problem and single machine scheduling problems with sequence dependent setup times

Applegate, 1998, On the solution of traveling salesman problems, Documenta Mathematica, 3, 645 Ascheuer, 2001, Solving the asymmetric travelling salesman problem with time windows by branch-and-cut, Mathematical Programming, 90, 475, 10.1007/PL00011432 Atamturk, 2000, Conflict graphs in solving integer programming problems, European Journal of Operations Research, 121, 40, 10.1016/S0377-2217(99)00015-6 Baptiste, 2005, Scheduling a single machine to minimize a regular objective function under setup considerations, Discrete Optimization, 2, 83, 10.1016/j.disopt.2004.12.003 Bianco, 1993, The traveling salesman problem with cumulative costs, Networks, 23, 81, 10.1002/net.3230230202 Dantzig, 1954, Solution of a large scale traveling salesman problem, Operations Research, 2, 393 Dantzig, 1960, Decomposition principle for linear programs, Operations research, 8, 101, 10.1287/opre.8.1.101 Desaulniers, 1998, A unified framework for deterministic time constrained vehicle routing and crew scheduling problems, 57 Fischetti, 1993, The delivery man problem and cumulative matroids, Operations Research, 31, 803 K.R. Fox, Production scheduling on parallel lines with dependencies, Ph.D. Thesis, The Johns Hopkins University, Baltimore, 1973 Fox, 1980, An n-constraint formulation of the (time-dependant) traveling salesman problem, Operations Research, 28, 1019, 10.1287/opre.28.4.1018 C. Gagné, M. Gravel, W.L. Price, Scheduling a single machine with sequence dependent time using an ant colony optimization, Technical Report 2001-003, Faculté des sciences de l’administration, Université Laval, 2001 Geoffrion, 1974, Lagrangean relaxation for integer programming, Mathematical Programming Study, 2, 82, 10.1007/BFb0120690 Hadley, 1964 Houck, 1980, The travelling salesman as a contrained shortest path problem: Theory and computational experiment, Opsearch, 17, 93 Irnich, 2005, Shortest path problems with resource constraints, 33 Irnich, 2003, The shortest path problem with resource constraints and k-cycle elimination for k≥3, Informs Journal on Computing, 18, 391, 10.1287/ijoc.1040.0117 Lawler, 1985 Lucena, 1990, Time-dependant traveling salesman problem-the deliveryman case, Networks, 20, 753, 10.1002/net.3230200605 Nemhauser, 1988 A.J. Orman, H.P. Williams, A survey of different integer programming formulations of the travelling salesman problem, Technical Report LSEOR 04.67, The London School of Economics and Political Science, 2004 Padberg, 1975, On the facial structure of set packing polyhedra, Mathematical Programming, 5, 199, 10.1007/BF01580121 Picard, 1978, The time-dependant traveling salesman problem and its application to the tardiness problem in one-machine scheduling, Operations Research, 26, 86, 10.1287/opre.26.1.86 M. Poggi de Aragao, E. Uchoa, Integer program reformulation for robust branch-and-cut-and-price algorithms, Techical Report, Departamento de Informatica, PUC-Rio, 2003 G.L. Ragatz, Scheduling to minimize tardiness on a single machine with sequence dependent setup times, Working Paper, Department of Management, Michigan State University, 1989 Rubin, 1995, Scheduling in a sequence dependent setup environment with genetic search, Computers and Operations Research, 22, 85, 10.1016/0305-0548(93)E0021-K Sourd, 2005, Earliness-tardiness scheduling with setup considerations, Computers and Operations Research, 32, 1849, 10.1016/j.cor.2003.12.002 Tan, 2000, A comparison of four methods for minimizing total tardiness on a single processor with sequence dependent setup times, Omega, 28, 313, 10.1016/S0305-0483(99)00050-X Vander Wiel, 1996, An exact solution approach for the time-dependent traveling-salesman problem, Naval Research Logistics, 43, 797, 10.1002/(SICI)1520-6750(199609)43:6<797::AID-NAV2>3.0.CO;2-# C.A. van Eijl, A polyhedral approach to the delivery man problem, Technical Report 95-19, Department of Mathematics and Computer Science, Eindhoven University of Technology, 1995 D. Villeneuve, Logiciel de génération de colonnes, Ph.D. Dissertation, École Polytechnique de Montréal, 1999