In yard-crane scheduling problems, as loading operations take priority over unloading, the delivery sequence of unloading from quaysides to yard is uncertain. The changes may make crane more difficult. As a result, schedules developed statically become suboptimal or even infeasible. this paper, we propose dynamic problem considering uncertain sequences. A mixed-integer linear program assign tas...

A bi-objective mathematical model is developed to simultaneously consider the quay crane and yard truck scheduling problems at container terminals. Main real-world assumptions, such as quay cranes with non-crossing constraints, quay cranes’ safety margins and precedence constraints are considered in this model. This integrated approach leads to better efficiency and productivity at container te...

In order to improve the operating efficiency of mixture storage yard, the problem of multiple yard cranes scheduling (MYCS) must to be solved. The paper develops a multiple yard cranes scheduling MIP model in order to minimize the sum of trucks’ waiting cost and yard cranes’ moving cost. An important feature is that the future has to be taken into account: the interference between two yard cran...

The paper studied a multi-machine and multi-task warehouse crane scheduling problem. The collision between adjacent cranes needs to be avoided in the scheduling problem. Considering the involved operation requirement and condition, a process simulation model was formulated to evaluate a candidate crane schedule through rehearsing the crane operation process. Based on the process simulation, an ...

the aim of this study is to propose a new mixed integer linear programming (milp) model to find the minimum required number of yard cranes, rubber tyred gantry cranes (rtgcs), for completion the total amount of works at the end of planning horizon. in other word, we find the optimal number of yard cranes in a container terminal which completes the total amount of works. the paper supports the p...

Crane sequencing in container terminals determines the order of ship discharging and loading jobs that quay cranes (QCs) perform so that the duration of vessels’ stay is minimized. The ship’s load profile, berthing time, number of available bays and QCs are considered. More importantly, clearance and yard congestion constraints need to be included, which respectively ensure that a minimum dista...

Nowadays, there is much attention for planning of container terminals in the global trade centers. The high cost of quay cranes motivates both scholars and industrial practitioners especially in the last decade to develop novel optimization models to address this dilemma. This study proposes a coordinated optimization model to cover both Quay Crane Scheduling Problem (QCSP) and Quay Crane Assig...