The quay crane scheduling problem studied in this paper is to determine a handling sequence of holds for quay cranes assigned to a container vessel considering interference between quay cranes. This paper provides a mixed integer programming model for the considered quay crane scheduling problem that is NP-complete in nature. A genetic algorithm is proposed to obtain near optimal solutions. Com...

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...

Quay crane allocation is one of the most important scheduling plans in the container terminal. A large of production data is stored in the database of the terminal. This paper utilizes the method of data mining to analyze the problem of quay crane allocation by using these data. From the mining, valuable information has been gotten from the database. The paper chooses the fuzzy cmeans cluster a...

This paper elaborates the different operations research methods used to solve container terminal operational decisions including terminal design, berth allocation, quay crane assignment, quay crane scheduling, container storage space allocation, container location assignment, retrieval, and premarshalling, as well as resource scheduling and terminal logistics in general. Solution methods includ...

The quay crane scheduling problem consists of determining a sequence of unloading and loading movements for cranes assigned to a vessel, in order to minimize the vessel completion time as well as the crane idle times. Idle times originate from interferences between cranes since these roll on the same rails and a minimum safety distance must be maintained between them. The productivity of contai...

We focus on the integrated seaside operations in container terminals, namely the integration of berth allocation, quay crane assignment and quay crane scheduling problems. We first develope a mixed-integer linear programming formulation. Then, we propose an efficient cutting plane algorithm based on a decomposition scheme. Our approach deals with berthing positions of the vessels and their assi...

Nowadays competition between port container terminals, especially between geographically close ones, is rapidly increasing. How to improve the competitiveness of port container terminals is, therefore, an immediate challenge, with which port operators are confronted. In terms of port competitiveness, the makespan of a container vessel, which is the latest completion time among all handling task...

In this work, we focus on the integrated planning of the following problems faced within the context of seaside operations at container terminals: berth allocation, quay crane assignment, and quay crane scheduling. First, we formulate a new binary integer linear program for the integrated solution of the berth allocation and quay crane assignment problems called BACAP. Then we extend it by inco...

This paper deals with the problem of constructing the schedule for the operations of a group of quay cranes devoted to discharge/load a set of groups of containers from a vessel at a maritime container terminal. The schedule is constructed starting from the assignment of each individual group of containers to a quay crane under the goal of minimizing the overall vessel completion time, aka the ...

The logistics operation of container terminal can be exploded into several subsystems which are correlative, these subsystems connect by some handling facilities. This paper study the coordinated scheduling of three main kinds of facilities-Quay Crane(QC),Yard Truck(YT) and Yard Crane(YC), use multidisciplinary variable coupling design optimization method(MVCDO) to build YT coordinated scheduli...