The traveling salesman problem with job-times (\textit{TSPJ})
From MaRDI portal
Publication:2668643
DOI10.1016/j.cor.2021.105226OpenAlexW3120800456MaRDI QIDQ2668643
Mohsen Mosayebi, Thomas A. Wettergren, Sodhi, Manbir S.
Publication date: 7 March 2022
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2021.105226
traveling salesman problemassignment problemscheduling problemmin makespansequence-dependent setup-time
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- The traveling salesman problem with time-dependent service times
- A vehicle routing problem with flexible time windows
- Soft time-windows for a bi-objective vendor selection problem under a multi-sourcing strategy: binary-continuous differential evolution
- Scheduling unrelated parallel machines with sequence-dependent setups
- An efficient implementation of local search algorithms for constrained routing problems
- The time-dependent traveling salesman problem and single machine scheduling problems with sequence dependent setup times
- A concise survey of scheduling with time-dependent processing times
- An interactive approach for hierarchical analysis of helicopter logistics in disaster relief operations
- Reformulations and an exact algorithm for unrelated parallel machine scheduling problems with setup times
- An adaptive large neighborhood search heuristic for the vehicle routing problem with time windows and synchronized visits
- Integrated production and multiple trips vehicle routing with time windows and uncertain travel 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
- Robust vehicle routing problem with hard time windows under demand and travel time uncertainty
- 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
- Models and algorithms for the traveling salesman problem with time-dependent service times
- An enhanced lower bound for the time-dependent travelling salesman problem
- Time-dependent asymmetric traveling salesman problem with time windows: properties and an exact algorithm
- An asymmetric TSP with time windows and with time-dependent travel times and costs: an exact solution through a graph transformation
- The routing open-shop problem on a network: complexity and approximation
- A sequential ordering problem in automotive paint shops
- Integer Programming Formulation of Traveling Salesman Problems
- Scheduling tasks with sequence-dependent processing times
- TSPLIB—A Traveling Salesman Problem Library
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Routing Two-Machine Flowshop Problems on Networks with Special Structure
- Solution of a Large-Scale Traveling-Salesman Problem
- Scheduling contractors' farm‐to‐farm crop harvesting operations
- An Effective Heuristic Algorithm for the Traveling-Salesman Problem
This page was built for publication: The traveling salesman problem with job-times (\textit{TSPJ})
