On Flow Time and Due Dates in Stochastic Open Shops. Revision.

摘要

In this paper we consider Open Shops where the jobs have exponentially distributed processing times. We determine the policies that in the class of preemptive policies minimize the expected Flow Time. We also consider Open Shops where the jobs have random due dates. Under certain conditions we determine the policies that maximize the expected number of jobs that complete their processing before their respective due dates. (Author)