A Note on Formulations of Static and Dynamic Berth Allocation Problems

Variable neighborhood search

Nenad Mladenović, Pierre Hansen · Computers & Operations Research · 1997 · 4.1K citations

A shortest augmenting path algorithm for dense and sparse linear assignment problems

R. Jonker, A. Volgenant · Computing · 1987 · 1.2K citations

Computing, Computer Science, Algorithms +10

Transshipment of containers at a container terminal: An overview

Iris F.A. Vis, René de Koster · European Journal of Operational Research · 2003 · 739 citations

Management, Operations Management, Transportation Planning +12

The dynamic berth allocation problem for a container port

Akio Imai, Etsuko Nishimura, Stratos Papadimitriou · Transportation Research Part B Methodological · 2001 · 569 citations

Management, Decision Sciences, Operations Management +11

Scheduling independent tasks to reduce mean finishing time

John Bruno, E. G. Coffman, Ravi Sethi · Communications of the ACM · 1974 · 500 citations · Full text

Computing, Computer Science, Algorithms +7