In this paper we consider, for the first time, the setup and travel times of cranes in the berth allocation and quay crane assignment problem. We first propose a new mixed integer linear programming model (MILP) for the problem without setups (BACASP), in which neither the berthing positions nor...

In this paper we study the problem of minimizing weighted earliness and tardiness on a single machine when all the jobs share the same due date. We propose two quadratic integer programming models for solving both cases of unrestricted and restricted due dates, an auxiliary model based on...

This paper presents an approach for solving a new real problem in cutting and packing. At its core is an innovative mixed integer programme model that places irregular pieces and defines guillotine cuts. The two-dimensional irregular shape bin packing problem with guillotine constraints arises...