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.

Microsoft Word (A New Dispatching Rule For The Stochastic Single-Machine Scheduling Problem) a_new_dispatching_rule_for_the_stochasti_al_turki_isip_000222080000006.doc Download (29kB)

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
Department:	College of Computing and Mathematics > lndustrial and Systems Engineering
Depositing User:	MR. ATIQ WALIULLAH SIDDIQUI
Date Deposited:	11 Jun 2008 07:38
Last Modified:	01 Nov 2019 13:44
URI:	http://eprints.kfupm.edu.sa/id/eprint/2432