【摘要】 本文讨论了一类工件加工时间随加工顺序而变的单机排序问题,在目标函数sum from i=1 to nC_i与Lmax下,Smith法则与Jackson法则仍然成立。从而推广了Smith与Jackson的结果。一般所考虑的单机排序问题是:有n个工件需要在一台机器上加工,而该机器只能一次加工一个工件,且工件j在该机器上所需的加工时间为P_i,这里P_j为一常量,即与工件早加工或晚加工无关。现在需要确定工件加工的一个顺序,使得在不同的目标下最优。更多还原

【Abstract】 In this Paper We discuss One Kind of Singlemachine Scheduling Problem in Which Processing time of a job is dependent on Processing Sequence. Two Optimality Criteria, sum from i=1 to n Ci and L_mat are Considered. We have generalized the results Obtained by Smith and Jackson, It is Shown that their rules are Still true. for the Case更多还原