Scheduling cranes at an indented berth

DOI10.1016/J.EJOR.2016.02.038zbMath1346.90323OpenAlexW2290535931MaRDI QIDQ323166

Marie-Anne Beens, Evrim Ursavas

Publication date: 7 October 2016

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

Full work available at URL: https://research.rug.nl/en/publications/scheduling-cranes-at-an-indented-berth(49c0b914-1e10-439a-a05e-cfc924791225).html

zbMATH Keywords

container terminal operationscrane schedulingcrane sequencingindented berthmaritime logistics

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Deterministic scheduling theory in operations research (90B35) Case-oriented studies in operations research (90B90)

Related Items (3)

Optimal policies for the berth allocation problem under stochastic nature ⋮ The synergistic effect of operational research and big data analytics in greening container terminal operations: a review and future directions ⋮ MIP approaches for the integrated berth allocation and quay crane assignment and scheduling problem

Cites Work

• Transport operations in container terminals: literature overview, trends, research directions and classification scheme
• A follow-up survey of berth allocation and quay crane scheduling problems in container terminals
• Berth allocation at indented berths for mega-containerships
• Container terminal operation and operations research -- a classification and literature review
• A multiple-crane-constrained scheduling problem in a container terminal
• A crane scheduling method for port container terminals
• Constraint and integer programming. Toward a unified methodology.
• On the complexity of container stowage planning problems
• Branch-and-Price: Column Generation for Solving Huge Integer Programs
• Crane scheduling with spatial constraints

This page was built for publication: Scheduling cranes at an indented berth