| THE SINGLE MACHINE STOCHASTIC SCHEDULING WITH THE WEIGHTED JOB TARDINESS MINIMIZATION |
| |
| 作者姓名： | Dequan YUE Fengsheng TU College of Sciences Yanshan University Qinhuangdao P.R.China College of Information Technical Science Nankai University Tianfin P.R.China |
| |
| 作者单位： | Dequan YUE Fengsheng TU College of Sciences Yanshan University，Qinhuangdao 066004，P.R.China College of Information Technical Science Nankai University，Tianfin 300071，P.R.China |
| |
| 基金项目： | ThisworkwassupportedpartlybytheNationalNaturalScienceFoundationofChina(GrantNo．60074018)
HebeiProvineeDoctoralFoundation(GrantNo.2002131)
HebeiProvinceNaturalScienceFoundation(GrantNo.A2004000185) |
| |
| 摘 要： | This paper considers scheduling n jobs on a single machine where the job processing times anddue dates are independent random variables with arbitrary distribution functions.We consider the casethat the weighted job tardiness in expectation is minimized.It is assumed that job's due dates arecompatible with processing times and weights.We show that the jobs should be sequenced indecreasing stochastic order of their due dates.
|
| 关 键 词： | 随机调度 随机因子 缓慢度 单体机器 分布函数 |
The single machine stochastic scheduling with the weighted job tardiness minimization |
| |
| Dequan YUE Fengsheng TU College of Sciences Yanshan University,Qinhuangdao ,P.R.China College of Information Technical Science Nankai University,Tianfin ,P.R.China.THE SINGLE MACHINE STOCHASTIC SCHEDULING WITH THE WEIGHTED JOB TARDINESS MINIMIZATION[J].Journal of Systems Science and Systems Engineering,2004,13(3):342-347. |
| |
| Authors: | Dequan Yue Fengsheng Tu |
| |
| Institution: | College of Sciences Yanshan University, Qinhuangdao 066004, ER. China;College of Information Technical Science Nankai University, Tianjin 300071, ER. China |
| |
| Abstract: | This paper considers scheduling n jobs on a single machine where the job processing times anddue dates are independent random variables with arbitrary distribution functions.We consider the casethat the weighted job tardiness in expectation is minimized.It is assumed that job's due dates arecompatible with processing times and weights.We show that the jobs should be sequenced indecreasing stochastic order of their due dates. |
| |
| Keywords: | Stochastic scheduling stochastic order tardiness |
| 本文献已被 CNKI 维普 万方数据 SpringerLink 等数据库收录！ |
