The sharing economy, ie, the cooperative consumption of goods and services offered by
private households or companies via online market places, gains more and more attention …

We provide new parameterized complexity results for Interval Scheduling on Eligible
Machines. In this problem, a set of n jobs is given to be processed non-preemptively on a set …

We consider the following online scheduling problem in which the input consists of n jobs to
be scheduled on identical machines of bounded capacity g (the maximum number of jobs …

As the adoption of electric vehicles continues to grow, the demand for extensive charging
infrastructure in urban areas is concurrently rising. In response to the evolving charging …

We study the problem of scheduling n non-preemptive jobs on m unrelated parallel
machines. Each machine can process a specified subset of the jobs. If a job is assigned to a …

Inland waterways are well-suited for freight transportation due to their reliability and cost-
effectiveness. Locks, acting as natural bottlenecks, are present on many inland waterways …

We study the fundamental scheduling problem $1\mid r_j\mid\sum w_j U_j $: schedule a set
of $ n $ jobs with weights, processing times, release dates, and due dates on a single …

We consider an interval scheduling problem where n jobs are required to be carried out by
m nonidentical machines in an offline-scheduling way. Each job has a starting time, a …

In this work, we study the computational (parameterized) complexity of $ P\mid r_j, p_j=
p\mid\sum_j w_j U_j $. Here, we are given $ m $ identical parallel machines and $ n $ jobs …

We consider the on-line preemptive scheduling of weighted equal-length intervals on
multiple machines to maximize the total weight of completed intervals. We design an …