Minimizing earliness-tardiness costs in supplier networks -- a just-in-time truck routing problem
From MaRDI portal
Publication:6106496
Recommendations
- Routing with Early Ordering for Just-In-Time Manufacturing Systems
- Optimal delivery time quotation in supply chains to minimize tardiness and delivery costs
- Solving an integrated scheduling and routing problem with inventory, routing and penalty costs
- The multi-objective multi-item just-in-time transportation problem
- A stochastic dynamic traveling salesman problem with hard time windows
Cites work
- A branch-and-price algorithm for the multi-depot heterogeneous-fleet pickup and delivery problem with soft time windows
- A general heuristic for vehicle routing problems
- A hybrid genetic algorithm with adaptive diversity management for a large class of vehicle routing problems with time-windows
- A metaheuristic for the vehicle-routeing problem with soft time windows
- A note on the lifted Miller-Tucker-Zemlin subtour elimination constraints for the capacitated vehicle routing problem
- A parallel route building algorithm for the vehicle routing and scheduling problem with time windows
- A penalty-based edge assembly memetic algorithm for the vehicle routing problem with time windows
- A review of vehicle routing with simultaneous pickup and delivery
- A Tabu Search Heuristic for the Vehicle Routing Problem with Soft Time Windows
- A unified solution framework for multi-attribute vehicle routing problems
- A unified tabu search algorithm for vehicle routing problems with soft time windows
- Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
- An iterated local search algorithm for the vehicle routing problem with convex time penalty functions
- An Optimization-Based Heuristic for Vehicle Routing and Scheduling with Soft Time Window Constraints
- Disrupted capacitated vehicle routing problem with order release delay
- Dynamic pickup and delivery problems
- Earliness-Tardiness Scheduling Problems, I: Weighted Deviation of Completion Times About a Common Due Date
- Exact and heuristic dynamic programming algorithms for the traveling salesman problem with flexible time windows
- Handbook of metaheuristics
- scientific article; zbMATH DE number 1082108 (Why is no real title available?)
- Improvements and extensions to Miller-Tucker-Zemlin subtour elimination constraints
- Just-in-time scheduling. Models and algorithms for computer and manufacturing systems
- Models and branch‐and‐cut algorithms for pickup and delivery problems with time windows
- Multi-period vehicle routing problem with due dates
- New Insertion and Postoptimization Procedures for the Traveling Salesman Problem
- On the worst-case performance of some heuristics for the vehicle routing and scheduling problem with time window constraints
- Part logistics in the automotive industry: decision problems, literature review and research agenda
- Recent progress of local search in handling the time window constraints of the vehicle routing problem
- Recent progress of local search in handling the time window constraints of the vehicle routing problem
- Scheduling of storage/retrieval orders under a just-in-time environment
- Sequential search and its application to vehicle-routing problems
- Ship scheduling with soft time windows: An optimisation based approach
- Simple Heuristics for the Vehicle Routeing Problem with Soft Time Windows
- Static pickup and delivery problems: a classification scheme and survey. (With comments and rejoinder)
- Survey Paper—Time Window Constrained Routing and Scheduling Problems
- The truck dispatching problem
- The vehicle routing problem
- The Vehicle Routing Problem with Release and Due Dates
- The Vehicle Routing Problem with Time Windows: Minimizing Route Duration
- Vehicle Routing
- Vehicle routing and reverse logistics: The vehicle routing problem with simultaneous delivery and pick-up
Cited in
(3)- Just-in-time logistics for far-distant suppliers: scheduling truck departures from an intermediate cross-docking terminal
- Formulations and an adaptive large neighborhood search for just-in-time scheduling of unrelated parallel machines with a common due window
- A leader-wingman-inspired cooperative-competitive optimization algorithm for sustainable part collection routing problem
This page was built for publication: Minimizing earliness-tardiness costs in supplier networks -- a just-in-time truck routing problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6106496)