The time-dependent traveling salesman problem and single machine scheduling problems with sequence dependent setup times
From MaRDI portal
Publication:955327
DOI10.1016/j.disopt.2008.04.001zbMath1152.90425OpenAlexW2064816527MaRDI QIDQ955327
Gilles Savard, Louis-Philippe Bigras, Michel Gamache
Publication date: 19 November 2008
Published in: Discrete Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disopt.2008.04.001
single machine schedulingtotal flow timetotal tardinesssequence dependent setupstime-dependent traveling salesman
Related Items (36)
An integer programming approach for the time-dependent TSP ⋮ A tabu search heuristic for a sequence-dependent and time-dependent scheduling problem on a single machine ⋮ The third comprehensive survey on scheduling problems with setup times/costs ⋮ Exact and heuristic algorithms for the parallel machine total completion time scheduling problem with dual resources, ready times, and sequence-dependent setup times ⋮ Minimising total tardiness for a single machine scheduling problem with family setups and resource constraints ⋮ The traveling salesman problem with time-dependent service times ⋮ A study of hybrid evolutionary algorithms for single machine scheduling problem with sequence-dependent setup times ⋮ Approaches for solving the container stacking problem with route distance minimization and stack rearrangement considerations ⋮ The traveling purchaser problem with time-dependent quantities ⋮ A branch-and-price algorithm for the minimum latency problem ⋮ An exact algorithm for the single-machine total weighted tardiness problem with sequence-dependent setup times ⋮ Time-dependent routing problems: a review ⋮ The traveling salesman problem with job-times (\textit{TSPJ}) ⋮ Semiconductor final-test scheduling under setup operator constraints ⋮ A simple and effective metaheuristic for the minimum latency problem ⋮ Solving the single crane scheduling problem at rail transshipment yards ⋮ The Surgical Patient Routing Problem: A Central Planner Approach ⋮ On the exact solution of a large class of parallel machine scheduling problems ⋮ Mathematical model applied to single-track line scheduling problem in Brazilian railways ⋮ The delivery man problem with time windows ⋮ The time dependent traveling salesman problem: polyhedra and algorithm ⋮ A GRASP based on DE to solve single machine scheduling problem with SDST ⋮ A worker constrained flexible job shop scheduling problem with sequence-dependent setup times ⋮ Natural and extended formulations for the time-dependent traveling salesman problem ⋮ A hybrid genetic algorithm for the single machine scheduling problem with sequence-dependent setup times ⋮ A variable neighborhood search for minimizing total weighted tardiness with sequence dependent setup times on a single machine ⋮ Can the agent with limited information solve travelling salesman problem? ⋮ A minmax regret version of the time-dependent shortest path problem ⋮ Facets and valid inequalities for the time-dependent travelling salesman problem ⋮ A hybrid reactive GRASP heuristic for the risk-averse \(k\)-traveling repairman problem with profits ⋮ Effective IG heuristics for a single-machine scheduling problem with family setups and resource constraints ⋮ Models and algorithms for the traveling salesman problem with time-dependent service times ⋮ A Local Search Algorithm for the Single Machine Scheduling Problem with Setups and a Storage ⋮ The risk-averse traveling repairman problem with profits ⋮ An efficient two-phase metaheuristic algorithm for the time dependent traveling Salesman problem ⋮ A unified heuristic and an annotated bibliography for a large class of earliness-tardiness scheduling problems
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the solution of traveling salesman problems
- The travelling salesman problem as a constrained shortest path problem: Theory and computational experience
- Scheduling in a sequence dependent setup environment with genetic search
- Earliness-tardiness scheduling with setup considerations
- Scheduling a single machine to minimize a regular objective function under setup constraints
- Conflict graphs in solving integer programming problems
- The Shortest-Path Problem with Resource Constraints and k-Cycle Elimination for k ≥ 3
- Decomposition Principle for Linear Programs
- The Time-Dependent Traveling Salesman Problem and Its Application to the Tardiness Problem in One-Machine Scheduling
- The Delivery Man Problem and Cumulative Matroids
- Time‐dependent traveling salesman problem–the deliveryman case
- Technical Note—An n-Constraint Formulation of the (Time-Dependent) Traveling Salesman Problem
- On the facial structure of set packing polyhedra
- The traveling salesman problem with cumulative costs
- Solution of a Large-Scale Traveling-Salesman Problem
- Shortest Path Problems with Resource Constraints
- Solving the asymmetric travelling salesman problem with time windows by branch-and-cut
This page was built for publication: The time-dependent traveling salesman problem and single machine scheduling problems with sequence dependent setup times
