一致条件下具学习因子的几个单机排序问题(英文)  

Some Single Machine Scheduling Problems with Learning Effect under Consistent Condition

作　　者：刘静[1] 孙世杰[2] 何龙敏[2] 

机构地区：[1]嘉兴学院信息工程分院,浙江嘉兴314001 [2]上海大学数学系,上海200436

出　　处：《运筹学学报》2003年第3期21-28,共8页Operations Research Transactions

摘　　要：n个工件需在同台机器上依次加工,工件j,j=1,2,…,n所需的正常加工时间为pj,如在某序中工件j第r个加工,则机器对其实际加工的时间为Pjrα,其中α≤0为一学习因子.要求适当排列这n个工件的加工顺序,使某目标函数达最小.本文对加权完工时间之和,最大迟后,延误工件数这三个目标函数,给出了在相应的一致条件下,对应的WSPT规则,EDD规则,修正Moore-Hodgson算法可获最优序,并估计了在一般情况下由该三规则所获序的误差.n Jobs are to be processed on the same machine, the basic processing time for job j is Pj,j= 1,2,..., n. In a given sequence, if job j is in position r, then the actual processing time for it is Pjrα, in which a (?) 0 is a given constant learning effect. We are asked to schedule the n jobs in such a way that some objective functions are minimized. For the following three objective functions: the total weighted completion time, the maximum lateness and the number of tardy job, this paper proves that the WSPT rule, the EDD rule and the modified Moore-Hodgson algorithm can construct the optimal sequence under corresponding consistent condition, respectively. This paper givers also the error estimation for these three rules in general cases.

关 键 词：学习因子 单机排序 一致性条件 完工时间 最大迟后 延误工件数 Moore-Hodgson算法 

分 类 号：O223[理学—运筹学与控制论] TH16[理学—数学]