KFUPM ePrints

A New Dispatching Rule For The Stochastic Single-Machine Scheduling Problem

Al-Turki, Umar and Andijani, A. A. and Arifulsalam, S A New Dispatching Rule For The Stochastic Single-Machine Scheduling Problem. SIMULATION-TRANSACTIONS OF THE SOCIETY FOR MODELING AND SIMULATION INTERNATIONAL, 80. pp. 165-170.

[img]Microsoft Word (A New Dispatching Rule For The Stochastic Single-Machine Scheduling Problem)
28Kb

Abstract

In this article, the authors consider the n-job single-machine scheduling problem in which jobs with stochastic processing time requirements arrive to the system at random times. The performance measure combines both mean and variance of job completion times. In this study, 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.



Item Type:Article
Subjects:Systems
Divisions:College Of Computer Sciences and Engineering > Systems Engineering Dept
Creators:Al-Turki, Umar and Andijani, A. A. and Arifulsalam, S
Email:alturki@ccse.kfupm.edu.sa, dijani@ccse.kfupm.edu.sa, UNSPECIFIED
ID Code:2432
Deposited By:MR. ATIQ WALIULLAH SIDDIQUI
Deposited On:11 Jun 2008 10:38
Last Modified:12 Apr 2011 13:12

Repository Staff Only: item control page