On the public citation graph

Integrated Optimization of Berth Allocation and Crane Assignment for Port Stevedoring Efficiency

https://doi.org/10.2139/ssrn.6187941
0 signed · 25 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/s00291-002-0109-zopenalex-snapshot
A scheduling method for Berth and Quay cranes
inferredcites →https://doi.org/10.1007/s00291-003-0140-8openalex-snapshot
The berth allocation problem: models and solution methods
inferredcites →https://doi.org/10.1007/s00291-007-0100-9openalex-snapshot
Operations research at container terminals: a literature update
inferredcites →https://doi.org/10.1016/j.cie.2013.12.012openalex-snapshot
An Integrated Quay Crane Assignment and Scheduling Problem
inferredcites →https://doi.org/10.1016/j.cie.2014.10.003openalex-snapshot
Integrating tactical and operational berth allocation decisions via Simulation–Optimization
inferredcites →https://doi.org/10.1016/j.cie.2015.04.033openalex-snapshot
A new continuous berth allocation and quay crane assignment model in container terminal
inferredcites →https://doi.org/10.1016/j.dss.2014.01.003openalex-snapshot
A decision support system for quayside operations in a container terminal
inferredcites →https://doi.org/10.1016/j.ejor.2009.05.031openalex-snapshot
A survey of berth allocation and quay crane scheduling problems in container terminals
inferredcites →https://doi.org/10.1016/j.ejor.2013.10.015openalex-snapshot
Optimal berth allocation and time-invariant quay crane assignment in container terminals
inferredcites →https://doi.org/10.1016/j.ejor.2014.12.030openalex-snapshot
A follow-up survey of berth allocation and quay crane scheduling problems in container terminals
inferredcites →https://doi.org/10.1016/j.ejor.2015.10.021openalex-snapshot
A Set-Partitioning-based model for the Berth Allocation Problem under Time-Dependent Limitations
inferredcites →https://doi.org/10.1016/j.ejor.2017.05.040openalex-snapshot
MIP approaches for the integrated berth allocation and quay crane assignment and scheduling problem
inferredcites →https://doi.org/10.1016/j.ejor.2018.11.007openalex-snapshot
New exact methods for the time-invariant berth allocation and quay crane assignment problem
inferredcites →https://doi.org/10.1016/j.eswa.2015.05.018openalex-snapshot
The continuous Berth Allocation Problem in a container terminal with multiple quays
inferredcites →https://doi.org/10.1016/j.swevo.2015.11.002openalex-snapshot
A HPSO for solving dynamic and discrete berth allocation problem and dynamic quay crane assignment problem simultaneously
inferredcites →https://doi.org/10.1016/j.tre.2008.03.001openalex-snapshot
Heuristics for the integration of crane productivity in the berth allocation problem
inferredcites →https://doi.org/10.1016/j.tre.2010.01.009openalex-snapshot
The continuous Berth Allocation Problem: A Greedy Randomized Adaptive Search Solution
inferredcites →https://doi.org/10.1016/j.tre.2013.03.003openalex-snapshot
Exact and heuristic methods to solve the berth allocation problem in bulk ports
inferredcites →https://doi.org/10.1016/j.tre.2015.06.008openalex-snapshot
Integrated Berth Allocation and Quay Crane Assignment Problem: Set partitioning models and computational results
inferredcites →https://doi.org/10.1016/j.tre.2017.06.013openalex-snapshot
Improved formulations and an Adaptive Large Neighborhood Search heuristic for the integrated berth allocation and quay crane assignment problem
inferredcites →https://doi.org/10.1016/s0167-6377(02)00147-5openalex-snapshot
A multiprocessor task scheduling model for berth allocation: heuristic and worst-case analysis
inferredcites →https://doi.org/10.1016/s0191-2615(02)00089-9openalex-snapshot
Storage space allocation in container terminals
inferredcites →https://doi.org/10.1016/s0191-2615(99)00057-0openalex-snapshot
The dynamic berth allocation problem for a container port
inferredcites →https://doi.org/10.1016/s0377-2217(00)00128-4openalex-snapshot
Berth allocation planning in the public berth system by genetic algorithms
inferredcites →https://doi.org/10.1016/s0377-2217(02)00293-xopenalex-snapshot
Transshipment of containers at a container terminal: An overview
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.