Ship scheduling with soft time windows: An optimisation based approach
From MaRDI portal
Publication:5935388
DOI10.1016/S0377-2217(00)00098-9zbMath0994.90069OpenAlexW2056532774MaRDI QIDQ5935388
Publication date: 26 June 2001
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0377-2217(00)00098-9
Transportation, logistics and supply chain management (90B06) Deterministic scheduling theory in operations research (90B35)
Related Items (19)
A survey on scheduling problems with due windows ⋮ Alternative approaches to the crude oil tanker routing and scheduling problem with split pickup and split delivery ⋮ A goal programming approach to vehicle routing problems with soft time windows ⋮ A vehicle routing problem with flexible time windows ⋮ The bi-objective insular traveling salesman problem with maritime and ground transportation costs ⋮ Routing and scheduling in project shipping ⋮ Cargo routing and scheduling problem in deep-sea transportation: case study from a fertilizer company ⋮ Multi‐objective optimization of the maritime cargo routing and scheduling problem ⋮ Minimizing earliness-tardiness costs in supplier networks -- a just-in-time truck routing problem ⋮ A multi-start local search heuristic for ship scheduling -- a computational study ⋮ Ship routing using genetic algorithms ⋮ Maximum satisfaction consensus with budget constraints considering individual tolerance and compromise limit behaviors ⋮ Shipment planning at oil refineries using column generation and valid inequalities ⋮ Bunker fuel cost and freight revenue optimization for a single liner shipping service ⋮ Discrete and dynamic versus continuous and static loading policy for a multi-compartment vehicle ⋮ Optimizing ship speed to minimize total fuel consumption with multiple time windows ⋮ CP methods for scheduling and routing with~time-dependent task costs ⋮ Transshipment service through crossdocks with both soft and hard time windows ⋮ A soft time-windowed mechanism for vendor selection model
Cites Work
- Unnamed Item
- Unnamed Item
- Vehicles scheduling with sliding time windows
- The pickup and delivery problem with time windows
- Ship scheduling: The last decade
- Routing problems: A bibliography
- A combined ship scheduling and allocation problem
- Technical Note—Optimizing the Schedule for a Fixed Vehicle Path with Convex Inconvenience Costs
- Optimizing Single Vehicle Many-to-Many Operations with Desired Delivery Times: I. Scheduling
- A Dynamic Programming Solution of the Large-Scale Single-Vehicle Dial-A-Ride Problem with Time Windows
- Pickup and Delivery of Partial Loads with “Soft” Time Windows
- An Optimization-Based Heuristic for Vehicle Routing and Scheduling with Soft Time Window Constraints
- A Tabu Search Heuristic for the Vehicle Routing Problem with Soft Time Windows
- A dynamic programming algorithm for the shortest path problem with time windows and linear node costs
- An Optimal Algorithm for the Traveling Salesman Problem with Time Windows
- Simple Heuristics for the Vehicle Routeing Problem with Soft Time Windows
This page was built for publication: Ship scheduling with soft time windows: An optimisation based approach
