Journal of Scheduling

We study a game theoretical model of multistage interval scheduling problems in which each job consists of exactly one task (interval) for each of t stages (machines). In the game theoretical model, the machine of each stage is controlled by a …

We consider the airplane refueling problem that was introduced by Gamow and Stern in their classical book Puzzle-Math (1958). In this setting, we wish to deliver a bomb the farthest possible distance, being much greater than the range of any …

In shop scheduling, several applications require that some components perform consecutively. We refer to “no-idle schedules” if machines are required to operate with no inserted idle time and to “no-wait schedules” if tasks cannot wait between the …

We consider the following scheduling problem. We have m identical machines, where each machine can accomplish one unit of work at each time unit. We have a set of n fully parallel jobs, where each job j has $$s_j$$ s j units of workload, and each …

Cloud applications bring new challenges to the design of network elements, in particular the burstiness of traffic workloads. A shared memory switch is a good candidate architecture to exploit buffer capacity; in this work, we analyze the …