Non-preemptive Throughput Maximization under Time-varying Capacity
Abstract
We study a variant of the job-shop scheduling problem, where unit-sized jobs must be assigned to a single machine, but the capacity of the machine changes over time.
