The traveling salesman problem with job-times (\textit{TSPJ})
From MaRDI portal
Publication:2668643
Recommendations
- The traveling salesman problem with time-dependent service times
- Special cases of traveling salesman and repairman problems with time windows
- The time-dependent traveling salesman problem and single machine scheduling problems with sequence dependent setup times
- Time‐dependent traveling salesman problem–the deliveryman case
- Sequencing jobs that require common resources on a single machine: A solvable case of the TSP
Cites work
- A concise survey of scheduling with time-dependent processing times
- A mathematical model and heuristic algorithms for an unrelated parallel machine scheduling problem with sequence-dependent setup times, machine eligibility restrictions and a common server
- A sequential ordering problem in automotive paint shops
- A vehicle routing problem with flexible time windows
- An adaptive large neighborhood search heuristic for the vehicle routing problem with time windows and synchronized visits
- An asymmetric TSP with time windows and with time-dependent travel times and costs: an exact solution through a graph transformation
- An Effective Heuristic Algorithm for the Traveling-Salesman Problem
- An efficient implementation of local search algorithms for constrained routing problems
- An enhanced lower bound for the time-dependent travelling salesman problem
- An interactive approach for hierarchical analysis of helicopter logistics in disaster relief operations
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1783886 (Why is no real title available?)
- Integer Programming Formulation of Traveling Salesman Problems
- Integrated production and multiple trips vehicle routing with time windows and uncertain travel times
- Models and algorithms for the traveling salesman problem with time-dependent service times
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Reformulations and an exact algorithm for unrelated parallel machine scheduling problems with setup times
- Robust vehicle routing problem with hard time windows under demand and travel time uncertainty
- Routing Two-Machine Flowshop Problems on Networks with Special Structure
- Scheduling contractors' farm‐to‐farm crop harvesting operations
- Scheduling tasks with sequence-dependent processing times
- Scheduling unrelated parallel machines with sequence-dependent setups
- Soft time-windows for a bi-objective vendor selection problem under a multi-sourcing strategy: binary-continuous differential evolution
- Solution of a Large-Scale Traveling-Salesman Problem
- The routing open-shop problem on a network: complexity and approximation
- The time-dependent traveling salesman problem and single machine scheduling problems with sequence dependent setup times
- The traveling salesman problem with time-dependent service times
- Time-dependent asymmetric traveling salesman problem with time windows: properties and an exact algorithm
- TSPLIB—A Traveling Salesman Problem Library
- Using high performance computing for unrelated parallel machine scheduling with sequence-dependent setup times: development and computational evaluation of a parallel branch-and-price algorithm
Cited in
(3)
This page was built for publication: The traveling salesman problem with job-times (\textit{TSPJ})
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2668643)
