Journal of Scheduling

This paper provides a unified family of algorithms with performance guarantees for malleable scheduling problems on flows. A flow represents a set of jobs with precedence constraints. Each job has a speedup function that governs the rate at which …

The aim of this research is to determine staffing requirements as well as shift scheduling, with the objective of maximizing the expected contribution from the venue. We specifically consider theaters where demand at concession stands is …

We consider the single-processor scheduling problem with time restrictions (STR) in order to minimize the makespan, where a set of independent jobs has to be processed on a single processor, subject only to the following constraint: During any …

In this paper, we address the waterway ship scheduling problem (WSSP), which finds applications in the management of ship arrivals and departures at maritime ports near channels and waterways. It incorporates practically relevant conflicts which …