In this paper we integrate at the tactical level two decision problems arising in container terminals: the berth allocation problem, which consists of assigning and scheduling incoming ships to berthing positions, and the quay crane assignment problem, which assigns to incoming ships a certain QC profile (i.e. number of quay cranes per working shift). We present two formulations: a mixed intege...

This paper addresses a decision problem related to simultaneously scheduling the tasks in a project and assigning the staff to these tasks, taking into account that a task can be performed only by employees with certain skills, and that the length of each task depends on the number of employees assigned. This type of problems usually appears in service companies, where both tasks scheduling and...

To solve problems abundant in real world applications, we have been proposing an approach of using general purpose solvers, since we cannot afford to develop special purpose algorithms for all individual problems. For this purpose, we have developed solvers for some standard problems such as CSP (constraint satisfaction problem), RCPSP (resource constrained project scheduling problem), GAP (gen...