Recommendations
- Berth allocation at indented berths for mega-containerships
- Modeling and solving rich quay crane scheduling problems
- Optimal berth allocation, time-variant quay crane assignment and scheduling with crane setups in container terminals
- A survey of berth allocation and quay crane scheduling problems in container terminals
- A branch-and-cut algorithm for the quay crane scheduling problem in a container terminal
Cites work
- A crane scheduling method for port container terminals
- A follow-up survey of berth allocation and quay crane scheduling problems in container terminals
- A multiple-crane-constrained scheduling problem in a container terminal
- Berth allocation at indented berths for mega-containerships
- Branch-and-price: Column generation for solving huge integer programs
- Constraint and integer programming. Toward a unified methodology.
- Container terminal operation and operations research -- a classification and literature review
- Crane scheduling with spatial constraints
- On the complexity of container stowage planning problems
- Transport operations in container terminals: literature overview, trends, research directions and classification scheme
Cited in
(4)- Optimal policies for the berth allocation problem under stochastic nature
- MIP approaches for the integrated berth allocation and quay crane assignment and scheduling problem
- A scheduling method for Berth and Quay cranes
- The synergistic effect of operational research and big data analytics in greening container terminal operations: a review and future directions
This page was built for publication: Scheduling cranes at an indented berth
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q323166)