Ship Scheduling with Recurring Visits and Visit Separation Requirements

DOI10.1007/0-387-25486-2_8MaRDI QIDQ5493633zbMATH OpenOpenAlexFDO

Authors Mikkel Sigurd, Nina Linn Ulstein, Bjørn Nygreen, David M. Ryan

Publication date 16 October 2006

Published in Column Generation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/0-387-25486-2_8

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Approximation methods and heuristics in mathematical programming (90C59) Deterministic scheduling theory in operations research (90B35)

Recommendations

• A combined ship scheduling and allocation problem
• Ship routing and scheduling in the new millennium
• Ship scheduling with soft time windows: An optimisation based approach
• Tramp ship routing and scheduling with voyage separation requirements
• Robust ship scheduling with multiple time windows

Cited in

(7)

• Industrial and tramp ship routing problems: closing the gap for real-scale instances
• Tramp ship routing and scheduling with voyage separation requirements
• Robust ship scheduling with multiple time windows
• Industrial aspects and literature survey: fleet composition and routing
• Classification of Ship Routing and Scheduling Problems in Liner Shipping
• A survey on maritime fleet size and mix problems
• Ship routing and scheduling in the new millennium

This page was built for publication: Ship Scheduling with Recurring Visits and Visit Separation Requirements

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5493633)