This paper considers algorithm selection for the berth allocation problem (BAP) under
algorithm runtime limits. BAP consists in scheduling ships on berths subject to ship ready …

We introduce a hard practical optimization problem, the ship traffic control problem (STCP).
We study it at the Kiel Canal, which is the most frequented artificial waterway in the world …

This paper studies a special parallel machine scheduling problem where some tasks require
more than one machine to process, known as the Parallel Machine Scheduling Problem with …

Task scheduling is a major challenging issue in parallel and distributed heterogeneous
computing systems. The task scheduling problem in a heterogeneous multiprocessor system …

The set of 2-dimensional packing problems builds an important class of optimization
problems and Strip Packing together with 2-dimensional Bin Packing and 2-dimensional …

We study Nonpreemptive Peak Demand Minimization (NPDM) problem, where we are given
a set of jobs, specified by their processing times and energy requirements. The goal is to …

In this paper, we study an extended formulation of moldable task scheduling problem
(MTSP) motivated by the assignments of quay cranes to vessels. In container terminals …

In the Demand Strip Packing problem (DSP), we are given a time interval and a collection of
tasks, each characterized by a processing time and a demand for a given resource (such as …

In this paper we address a novel extension of the well-known multiple strip packing problem.
Given a set of rectangular items that must be packed into a set of strips of predefined widths …

Abstract We consider the Demand Strip Packing problem (DSP), in which we are given a set
of jobs, each specified by a processing time and a demand. The task is to schedule all jobs …