Feinberg, Eugene A.; Curry, Michael T. - In: Computational Statistics 62 (2005) 1, pp. 99-122
This paper studies a non-preemptive infinite-horizon scheduling problem with a single server and a fixed set of recurring jobs. Each job is characterized by two given positive numbers: job duration and maximum allowable time between the job completion and its next start. We show that for a...