Scheduling cranes at an indented berth
DOI10.1016/J.EJOR.2016.02.038zbMATH Open1346.90323OpenAlexW2290535931MaRDI QIDQ323166FDOQ323166
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
Deterministic scheduling theory in operations research (90B35) Case-oriented studies in operations research (90B90) Transportation, logistics and supply chain management (90B06)
Cites Work
- A crane scheduling method for port container terminals
- Branch-and-price: Column generation for solving huge integer programs
- Container terminal operation and operations research -- a classification and literature review
- On the complexity of container stowage planning problems
- 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
- A multiple-crane-constrained scheduling problem in a container terminal
- Constraint and integer programming. Toward a unified methodology.
- Crane scheduling with spatial constraints
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)
