• Open Daily: 10am - 10pm
    Alley-side Pickup: 10am - 7pm

    3038 Hennepin Ave Minneapolis, MN
    612-822-4611

Open Daily: 10am - 10pm | Alley-side Pickup: 10am - 7pm
3038 Hennepin Ave Minneapolis, MN
612-822-4611
Analysis of Scheduling Policies for A M/G/1 Queue With Rework

Analysis of Scheduling Policies for A M/G/1 Queue With Rework

Paperback

Business GeneralGeneral EducationProbability & Statistics

ISBN10: 1249584485
ISBN13: 9781249584483
Publisher: Biblioscholar
Published: Oct 3 2012
Pages: 56
Weight: 0.20
Height: 0.12 Width: 6.14 Depth: 9.21
Language: English

This thesis analyzes a multi-class M/G/1 priority queueing system in which distinct job types require one service cycle and, with non-zero probability, require a second service cycle. The main objective is to find a new heuristic scheduling policy that minimizes the long-run expected holding and preemption costs. Arrival rates, service rates, and the probability of undertaking second service are all class specific. A mean value analysis (MVA) approach was employed to derive the long-run mean time in queue for each job type under each policy, thereby providing the appropriate cost equations. Numerical experiments suggest that the preemptive resume scheduling policy yields the lowest cost most frequently.

Also in

General Education