Ship scheduling with soft time windows: An optimisation based approach

DOI10.1016/S0377-2217(00)00098-9zbMath0994.90069MaRDI QIDQ5935388

Kjetil Fagerholt

Publication date: 26 June 2001

Published in: European Journal of Operational Research (Search for Journal in Brave)

zbMATH Keywords

transportation; scheduling; ships; soft time windows

Mathematics Subject Classification ID

90B06: Transportation, logistics and supply chain management

90B35: Deterministic scheduling theory in operations research

Related Items

Alternative approaches to the crude oil tanker routing and scheduling problem with split pickup and split delivery, A vehicle routing problem with flexible time windows, Routing and scheduling in project shipping, Shipment planning at oil refineries using column generation and valid inequalities, Transshipment service through crossdocks with both soft and hard time windows, A goal programming approach to vehicle routing problems with soft time windows, A multi-start local search heuristic for ship scheduling -- a computational study, Discrete and dynamic versus continuous and static loading policy for a multi-compartment vehicle, CP methods for scheduling and routing with~time-dependent task costs, A survey on scheduling problems with due windows, A soft time-windowed mechanism for vendor selection model

Cites Work

• Unnamed Item
• 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
• An Optimal Algorithm for the Traveling Salesman Problem with Time Windows
• Simple Heuristics for the Vehicle Routeing Problem with Soft Time Windows