Keywords: Quay crane assignment Quay crane scheduling Genetic algorithms Integrated models a b s t r a c t This paper presents a new approach to analyze the integrated quay crane assignment and scheduling problem (QCASP). The problem determines the assignment of quay cranes to vessels and the sequence of tasks to be processed by each quay crane simultaneously, and accounts for important conside...

Decision makers must face the dynamism and uncertainty of real-world environments when they need to solve the scheduling problems. Different incidences or breakdowns, for example, initial data could change or some resources could become unavailable, may eventually cause the infeasibility of the obtained schedule. To overcome this issue, a robust model and a proactive approach are presented for ...

Due to the dramatic increase in the world’s container traffic, the efficient management of operations in seaport container terminals has become a crucial issue. In this work, we focus on the integrated planning of the following problems faced at container terminals: berth allocation, quay crane assignment (number), and quay crane assignment (specific). First, we formulate a new binary integer l...

This paper puts forward an integrated optimisation model that combines two distinct problems arising in container terminals, namely the Quay Crane Assignment Problem, and the Quay Crane Scheduling Problem. The model is of the mixed-integer programming type with the objective being to minimise the tardiness of vessels. Although exact solutions can be found to the problem using Branch-and-Cut, fo...

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

Most of the operational problems in container terminals are strongly interconnected. In this paper, we study the integrated berth allocation and quay crane assignment problem in seaport container terminals. We will extend the current stateof-the-art by proposing novel set partitioning models. To improve the performance of the set partitioning formulations, a number of variable reduction techniq...

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

In this paper we focus our attention on the operational decision problems related to the seaside area of maritime container terminals. In particular, we face the Quay Crane Assignment Problem (QCAP) and Quay Crane Scheduling Problem (QCSP) with an integrated simulation-optimization approach. A 0/1 MIP model is developed in order to determine the optimal assignment, on a shift basis, of QCs to b...