| 一类带折扣加权总完工时间单机排序问题 |
| |
| 引用本文： | 孙笑微,赵大宇.一类带折扣加权总完工时间单机排序问题[J].沈阳师范大学学报(自然科学版),2005,23(3):229-232. |
| |
| 作者姓名： | 孙笑微 赵大宇 |
| |
| 作者单位： | 沈阳师范大学,数学与系统科学学院,辽宁,沈阳,110034 |
| |
| 基金项目： | 辽宁省高等学校科学研究项目(202112020). |
| |
| 摘 要： | 讨论了工件加工时间和排列中位置相关的单机排序问题．对工件加工时间和位置相关的两个线性模型Pi(v)=ai-biv和pi(v)=aiv^-b进行了讨论，目标函数是带折扣的加权总完工时间,并且对工件加工时间与给定权值之间具有一致关系的某些情况给出了最优算法。
|
| 关 键 词： | 最优排序 单机 一致关系 加工时间 |
| 文章编号： | 1008-374X(2005)03-0229-04 |
| 修稿时间： | 2004年12月16 |
The single scheduling problem of minimum total completion times with discounted weight |
| |
| SUN Xiao-wei,ZHAO Da-yu.The single scheduling problem of minimum total completion times with discounted weight[J].Journal of Shenyang Normal University: Nat Sci Ed,2005,23(3):229-232. |
| |
| Authors: | SUN Xiao-wei ZHAO Da-yu |
| |
| Abstract: | In this paper we study a single machine scheduling problem in which the processing time of a job is dependent on its position in a sequence.Two linear processing time functions used to model the job processing times characterized by position-dependent are discussed,that is p_i(v)=a\-i-b\-iv and p\-i(v)=a\-iv~(-b).The objective function is to minimize the total completion times with discounted weight.Optimal algorithms for the job processing times with given weights are agreeable in several cases are discussed respectively. |
| |
| Keywords: | optimal scheduling single machine agreeable relation processing times |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
