Journal of Applied Sciences ›› 1998, Vol. 16 ›› Issue (4): 479-485.

• Articles • Previous Articles     Next Articles

The Construction of the Efficient Points Set for 1/r,pj≡1/Lmax with Controllable Due Dates

SUN SHIJIE, R. J. KIBET   

  1. Mathematics Department, Shanghai University, Shanghai 201800
  • Received:1997-01-25 Revised:1997-08-08 Online:1998-12-31 Published:1998-12-31

Abstract: This paper considers the machine sequencing problem 1/r,pj≡1/Lmax with controllable due dates.Taking Lmax as F1 and the total delaies of due dates as F2,for the minimizing the F1 and F2 simultaneously,the paper constructs a pseudopolynomial time algorithm for finding out its efficient point set.

Key words: maximum lateness, algorithm, controllable due date, sequencing