Recently, the single machine scheduling problem with past-sequence-dependent (p-s-d) setup times is getting more attentions from academic researchers and industrial practitioners. The past-sequence-dependent setup times are proportional to the length of already scheduled jobs. It is shown that for a number of objective functions this scheduling problem can be solved in O(n log n) time. In this paper, we extend the analysis of the problem with the total absolute difference in completion times (TADC) as the objective function. This problem is denoted as 1/spsd/T ADC in [1]. Let s[j] and p[j] be the setup time and processing time of a job occupying position j in the sequence respectively, and s[j] is defined as s[j] = γ ∑j−1 i=1 p[i] , where γ is a normalizing constant. In this paper, we present a parametric analysis of γ on the 1/spsd/T ADC problem. We show analytically the number of optimal sequences and the range of γ in which each of the sequence is optimal. We prove that the number of optimal sequences is {1 + ∑x k=1(2k)} if n is odd, and {1+∑x k=1(2k−1)} if n is even. The value of x is b n 2 c−1 when n is odd, and x is n 2 when is even. The number of optimal sequences depends only on n, the number of jobs, and not on γ. We also show analytically that when γ > (n−3) 2(n−2) , the optimal sequence is unique and is obtained by placing the longest job in first position and the rest of the jobs in SPT order in positions 2 to n.
關聯:
International Journal of Innovative Computing, Information and Control 6(3A), p.1113–1121
