Optimal berth allocation, time-variant quay crane assignment and scheduling with crane setups in container terminals
From MaRDI portal
(Redirected from Publication:323449)
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
Cites work
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- A follow-up survey of berth allocation and quay crane scheduling problems in container terminals
- A scheduling method for Berth and Quay cranes
- A survey of berth allocation and quay crane scheduling problems in container terminals
- Container terminal operation and operations research -- a classification and literature review
- Crane scheduling with non-crossing constraint
- Crane scheduling with spatial constraints
- Network flows. Theory, algorithms, and applications.
- Operations research at container terminals: a literature update
- Optimal berth allocation and time-invariant quay crane assignment in container terminals
- Partitioning procedures for solving mixed-variables programming problems
- Quay crane scheduling at container terminals to minimize the maximum relative tardiness of vessel departures
- The integer \(L\)-shaped method for stochastic integer programs with complete recourse
- Transshipment of containers at a container terminal: An overview
Cited in
(43)- Exact and heuristic methods for the integrated berth allocation and specific time-invariant quay crane assignment problems
- A Lagrangian relaxation approach for solving the integrated quay crane assignment and scheduling problem
- A queuing network model for the management of berth crane operations
- An online model of berth and quay crane integrated allocation in container terminals
- An evolutionary approach to a combined mixed integer programming model of seaside operations as arise in container ports
- Simultaneous Optimization of Berth Allocation, Quay Crane Assignment and Quay Crane Scheduling Problems in Container Terminals
- Periodic and collaborative allocation of berth-yard-gate resources at container terminals
- A robust multiobjective model for the integrated berth and quay crane scheduling problem at seaside container terminals
- Optimal berth allocation and time-invariant quay crane assignment in container terminals
- Compact ILP formulations for a class of solutions to berth allocation and quay crane scheduling problems
- Minimum cost flow problem with conflicts
- The berth allocation problem with a cut-and-run option
- Integrated proactive-reactive approach and a hybrid adaptive large neighborhood search algorithm for berth and quay crane scheduling under uncertain combination
- Carbon-efficient scheduling problem of electric rubber-tyred gantry cranes in a container terminal
- 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
- The berth allocation and quay crane assignment problem with crane travel and setup times
- Integrated laycan and berth allocation and time-invariant quay crane assignment problem in tidal ports with multiple quays
- Integrated berth allocation and time-variant quay crane scheduling with tidal impact in approach channel
- 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
- Optimizing the landside operation of a container terminal
- Assignment problem with conflicts
- Scheduling quay cranes and shuttle vehicles simultaneously with limited apron buffer capacity
- Approximate the scheduling of quay cranes with non-crossing constraints
- Robust scheduling for berth allocation and quay crane assignment problem
- Minimum cost noncrossing flow problem on layered networks
- A joint quay crane assignment and scheduling problem: formulation, solution algorithm and computational results
- Online integrated allocation of berths and quay cranes in container terminals with 1-lookahead
- The berth allocation problem in terminals with irregular layouts
- A follow-up survey of berth allocation and quay crane scheduling problems in container terminals
- An exact robust approach for the integrated berth allocation and quay crane scheduling problem under uncertain arrival times
- Scheduling cranes at an indented berth
- The quay crane scheduling problem with non-crossing and safety clearance constraints: an exact solution approach
- 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
- Straddle carrier routing at seaport container terminals in the presence of short term quay crane buffer areas
- 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
- Nonlinear mathematical programming for optimal management of container terminals
- Simultaneous allocation of berths and quay cranes under discrete berth situation
- A scheduling method for Berth and Quay cranes
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)
