

As the maritime industry grows rapidly in size, more attention is being paid to to a wide range of aspects of problems faced at ports with respect to the efficient allocation of resources. A very important seaside planning problem that has received large attention in literature lately is the quay crane scheduling problem (QCSP). The problem involves the creation of a work schedule for the available quay cranes at the port to vessel or given set of vessels. These optimization problems can be very complex and since they involve a large number of variables and constraints, the use of a commercial solver is impractical. In this paper, we reformulate a problem that can be solved by column generation. Finally, the proposed model was coded and solved by the exact solver GAMS 25.0 and evaluated by some evident examples. Also in view of theoretical challenges, and industrial implicating a genetic algorithm is proposed to solve the problem. The performance of proposed algorithm is evaluated by a number of numerical example. Finally, computational results show that the proposed algorithm significantly outperforms.