A new dispatching rule for stochastic and dynamic job scheduling

Umar Al-Turki*

*Corresponding author for this work

Research output: Contribution to journalConference articlepeer-review

Abstract

In this paper we consider the n job single machine scheduling problem were jobs with stochastic processing time requirements arrive to the system at random times. The performance measure combines both mean and variance of job completion time. In this paper a dispatching rule is designed to minimize the performance measure using a simulation model built using AWESIM. Different variations of the rule are tested to select the best implementing policy of the rule. Extensive experimentation is conducted to determine the best parameter values in terms of problem parameters.

Original languageEnglish
Pages (from-to)536-539
Number of pages4
JournalSimulation Series
Volume35
Issue number3
StatePublished - 2003

Keywords

  • Dispatching rule
  • Dynamic
  • Scheduling
  • Stochastic

ASJC Scopus subject areas

  • Computer Networks and Communications

Fingerprint

Dive into the research topics of 'A new dispatching rule for stochastic and dynamic job scheduling'. Together they form a unique fingerprint.

Cite this