Analysis of Scheduling Policies for a M/G/1 Queue with Rework

Abstract

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.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Mar 01, 2003
Accession Number
ADA413188

Entities

People

  • Jennifer K. Hendrixson

Organizations

  • Air Force Institute of Technology

Tags

Communities of Interest

  • C4I
  • Human Systems
  • Materials and Manufacturing Processes

DTIC Thesaurus Topics

  • Air Force
  • Algorithms
  • Computer Programs
  • Engineering
  • Equations
  • Manufacturing
  • Markov Chains
  • Markov Processes
  • Mathematical Models
  • Models
  • Operations Research
  • Probability
  • Random Variables
  • Scheduling (Production)
  • Simulations
  • Steady State
  • Stochastic Processes

Readers

  • Logistics and Supply Chain Management.
  • Mathematical Modeling and Probability Theory.