Optimal berth allocation, time-variant quay crane assignment and scheduling with crane setups in container terminals

DOI10.1016/J.EJOR.2016.04.022zbMATH Open1346.90394OpenAlexW2342820711MaRDI QIDQ323449FDOQ323449

Authors: Yavuz B. Türkoğulları, Z. Caner Taşkın, Necati Aras, İ. Kuban Altınel 

Publication date: 7 October 2016

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

Full work available at URL: https://doi.org/10.1016/j.ejor.2016.04.022

Recommendations

• Optimal berth allocation and time-invariant quay crane assignment in container terminals
• Simultaneous Optimization of Berth Allocation, Quay Crane Assignment and Quay Crane Scheduling Problems in Container Terminals
• New exact methods for the time-invariant berth allocation and quay crane assignment problem
• A survey of berth allocation and quay crane scheduling problems in container terminals
• MIP approaches for the integrated berth allocation and quay crane assignment and scheduling problem

zbMATH Keywords

integer programmingberth allocationcontainer terminal managementcrane assignmentcrane scheduling

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Integer programming (90C10) Discrete location and assignment (90B80)

Cites Work

• Network flows. Theory, algorithms, and applications.
• Title not available (Why is that?)
• Partitioning procedures for solving mixed-variables programming problems
• A survey of berth allocation and quay crane scheduling problems in container terminals
• Container terminal operation and operations research -- a classification and literature review
• Operations research at container terminals: a literature update
• The integer \(L\)-shaped method for stochastic integer programs with complete recourse
• Transshipment of containers at a container terminal: An overview
• A scheduling method for Berth and Quay cranes
• Optimal berth allocation and time-invariant quay crane assignment in container terminals
• A follow-up survey of berth allocation and quay crane scheduling problems in container terminals
• Crane scheduling with non-crossing constraint
• Crane scheduling with spatial constraints
• Quay crane scheduling at container terminals to minimize the maximum relative tardiness of vessel departures

Cited In (42)

• A queuing network model for the management of berth crane operations
• Integrated berth allocation and time-variant quay crane scheduling with tidal impact in approach channel
• An evolutionary approach to a combined mixed integer programming model of seaside operations as arise in container ports
• The berth allocation problem with a cut-and-run option
• Approximate the scheduling of quay cranes with non-crossing constraints
• The quay crane scheduling problem with non-crossing and safety clearance constraints: an exact solution approach
• A Lagrangian relaxation approach for solving the integrated quay crane assignment and scheduling problem
• The berth allocation problem in terminals with irregular layouts
• Simultaneous allocation of berths and quay cranes under discrete berth situation
• Exact and heuristic methods for the integrated berth allocation and specific time-invariant quay crane assignment problems
• Online integrated allocation of berths and quay cranes in container terminals with 1-lookahead
• Berth scheduling for container terminals by using a sub-gradient optimization technique
• Integrated laycan and berth allocation and time-invariant quay crane assignment problem in tidal ports with multiple quays
• Simultaneous Optimization of Berth Allocation, Quay Crane Assignment and Quay Crane Scheduling Problems in Container Terminals
• A follow-up survey of berth allocation and quay crane scheduling problems in container terminals
• Minimum cost flow problem with conflicts
• Straddle carrier routing at seaport container terminals in the presence of short term quay crane buffer areas
• Nonlinear mathematical programming for optimal management of container terminals
• Compact ILP formulations for a class of solutions to berth allocation and quay crane scheduling problems
• Scheduling cranes at an indented berth
• A proactive approach for simultaneous berth and quay crane scheduling problem with stochastic arrival and handling time
• Multi-objective and prioritized berth allocation in container ports
• A study of online berth and quay crane integrated allocation problem with lookahead ability
• An online model of berth and quay crane integrated allocation in container terminals
• A robust multiobjective model for the integrated berth and quay crane scheduling problem at seaside container terminals
• A joint quay crane assignment and scheduling problem: formulation, solution algorithm and computational results
• Carbon-efficient scheduling problem of electric rubber-tyred gantry cranes in a container terminal
• Assignment problem with conflicts
• MIP approaches for the integrated berth allocation and quay crane assignment and scheduling problem
• New exact methods for the time-invariant berth allocation and quay crane assignment problem
• Robust scheduling for berth allocation and quay crane assignment problem
• A scheduling method for Berth and Quay cranes
• Periodic and collaborative allocation of berth-yard-gate resources at container terminals
• Optimizing the landside operation of a container terminal
• Online Integrated Allocation of Berths and Quay Cranes in Container Terminals with 1-Lookahead
• An exact robust approach for the integrated berth allocation and quay crane scheduling problem under uncertain arrival times
• Optimal berth allocation and time-invariant quay crane assignment in container terminals
• Simultaneous operation of next-generation and traditional quay cranes at container terminals
• The synergistic effect of operational research and big data analytics in greening container terminal operations: a review and future directions
• Minimum cost noncrossing flow problem on layered networks
• The berth allocation and quay crane assignment problem with crane travel and setup times
• Integrated proactive-reactive approach and a hybrid adaptive large neighborhood search algorithm for berth and quay crane scheduling under uncertain combination

This page was built for publication: Optimal berth allocation, time-variant quay crane assignment and scheduling with crane setups in container terminals

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