A New Dispatching Rule For The Stochastic Single-Machine Scheduling Problem
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 des...
محفوظ في:
| المؤلف الرئيسي: | |
|---|---|
| مؤلفون آخرون: | , , |
| التنسيق: | article |
| منشور في: |
2020
|
| الموضوعات: | |
| الوصول للمادة أونلاين: | https://eprints.kfupm.edu.sa/id/eprint/2432/1/a_new_dispatching_rule_for_the_stochasti_al_turki_isip_000222080000006.doc |
| الوسوم: |
إضافة وسم
لا توجد وسوم, كن أول من يضع وسما على هذه التسجيلة!
|
| _version_ | 1864513401223380992 |
|---|---|
| author | Al-Turki, Umar |
| author2 | Andijani, A. A. Arifulsalam, S unknown |
| author2_role | author author author |
| author_facet | Al-Turki, Umar Andijani, A. A. Arifulsalam, S unknown |
| author_role | author |
| dc.creator.none.fl_str_mv | Al-Turki, Umar Andijani, A. A. Arifulsalam, S unknown |
| dc.date.*.fl_str_mv | 2020 |
| dc.format.none.fl_str_mv | application/msword |
| dc.identifier.none.fl_str_mv | https://eprints.kfupm.edu.sa/id/eprint/2432/1/a_new_dispatching_rule_for_the_stochasti_al_turki_isip_000222080000006.doc 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. |
| dc.language.none.fl_str_mv | en |
| dc.publisher.none.fl_str_mv | SAGE PUBLICATIONS LTD |
| dc.relation.none.fl_str_mv | https://eprints.kfupm.edu.sa/id/eprint/2432/ |
| dc.rights.*.fl_str_mv | info:eu-repo/semantics/openAccess |
| dc.subject.none.fl_str_mv | Systems |
| dc.title.none.fl_str_mv | A New Dispatching Rule For The Stochastic Single-Machine Scheduling Problem |
| dc.type.none.fl_str_mv | Article PeerReviewed info:eu-repo/semantics/publishedVersion info:eu-repo/semantics/article |
| description | 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. |
| eu_rights_str_mv | openAccess |
| format | article |
| id | KFUPM_e02b1271cdc2d79cfe6a96269f55ba28 |
| identifier_str_mv | 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. |
| language_invalid_str_mv | en |
| network_acronym_str | KFUPM |
| network_name_str | King Fahd University of Petroleum and Minerals |
| oai_identifier_str | oai::2432 |
| publishDate | 2020 |
| publisher.none.fl_str_mv | SAGE PUBLICATIONS LTD |
| repository.mail.fl_str_mv | |
| repository.name.fl_str_mv | |
| repository_id_str | |
| spelling | A New Dispatching Rule For The Stochastic Single-Machine Scheduling ProblemAl-Turki, UmarAndijani, A. A.Arifulsalam, SunknownSystemsIn 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.SAGE PUBLICATIONS LTDArticlePeerReviewedinfo:eu-repo/semantics/publishedVersioninfo:eu-repo/semantics/articleapplication/mswordhttps://eprints.kfupm.edu.sa/id/eprint/2432/1/a_new_dispatching_rule_for_the_stochasti_al_turki_isip_000222080000006.doc 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. enhttps://eprints.kfupm.edu.sa/id/eprint/2432/2020info:eu-repo/semantics/openAccessoai::24322019-11-01T13:44:06Z |
| spellingShingle | A New Dispatching Rule For The Stochastic Single-Machine Scheduling Problem Al-Turki, Umar Systems |
| status_str | publishedVersion |
| title | A New Dispatching Rule For The Stochastic Single-Machine Scheduling Problem |
| title_full | A New Dispatching Rule For The Stochastic Single-Machine Scheduling Problem |
| title_fullStr | A New Dispatching Rule For The Stochastic Single-Machine Scheduling Problem |
| title_full_unstemmed | A New Dispatching Rule For The Stochastic Single-Machine Scheduling Problem |
| title_short | A New Dispatching Rule For The Stochastic Single-Machine Scheduling Problem |
| title_sort | A New Dispatching Rule For The Stochastic Single-Machine Scheduling Problem |
| topic | Systems |
| url | https://eprints.kfupm.edu.sa/id/eprint/2432/1/a_new_dispatching_rule_for_the_stochasti_al_turki_isip_000222080000006.doc |