CAJ | 학술논문

n个工件需在同台机器上依次加工,工件j,j=1,2,…,n所需的正常加工时间为pj,如在某序中工件j第r个加工,则机器对其实际加工的时间为pjrα,其中α≤0为一学习因子.要求适当排列这n个工件的加工顺序,使某目标函数达最小.本文对加权完工时间之和,最大迟后,延误工件数这三个目标函数,给出了在相应的一致条件下,对应的WSPT规则,EDD规则,修正Moore-Hodgson算法可获最优序,并估计了在一般情况下由该三规则所获序的误差.
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 α≤ 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.