A crane scheduling method for port container terminals

By Kap-Hwan Kim, Young-Man Park. European Journal of Operational Research, 2004

536 citations recorded by the source corpus.

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

The multiple traveling salesman problem: an overview of formulations and solution procedures (2006, background): “Transportation School bus routing [11] planning Crane scheduling [21] Local truckload pickup and delivery [23]”
The quay crane scheduling problem with time windows (2011, methodology): “Among the above studies, [1,4,5,13,16,17] consider individual ready times for cranes at a vessel but only [4] assumes that there is also a withdraw time given for each crane at which the equipment must be removed again from the vessel.”
Traveling Salesman Problem: an Overview of Applications, Formulations, and Solution Approaches (2010, unknown): “…mTSP Minimize ij ij m i j c x f ≠ +∑ Subject to ( )1 1 2 2 n j j j x x m = + =∑ (22) 1ik i k x ≠ =∑ 2,.......,k n= (23) www.intechopen.com Traveling Salesman Problem, Theory and Applications 10 1ik j k x ≠ =∑ 2,.......,k n= (24) ; , 1ij i j i j S x S ≠ ∈ ≤ −∑ 2 2S n≤ ≤ − , { }\ 1S V⊆…”