Analysis of the Earliest Due Date Scheduling Rule in Queueing Systems |
Common terms and phrases
arbitrary number busy period Chapter class h customers class i arriving Corollary customer arriving customer from class customers that arrived date scheduling rule denote described in section due date rule due date scheduling dynamic priority discipline dynamic priority queue-discipline dynamic priority scheduling earliest due date equations expected tardiness FCFS finite number given higher priority inf{x initial workload input of workload Jackson's conjecture k classes K₁₂ M/G/1 system mean waiting min{T W(t non-homogeneous Poisson arrivals non-homogeneous Poisson process objective function optimal pre-emptive discipline priority queue process with parameter queueing model queueing theory random variables section 2.1 server queueing system service time distribution single server queueing stochastic model system in steady t-u₂ t-up t,t+u t}dt t₁ T₁₂ W(t T₂ take precedence Theorem 2.1 total workload u₁ u₂ urgency numbers virtual lateness ŵ t+u;W(t ŵ₁₂ W₂(t We(t workload W(t y}dy Ալ Աշ