Le Thi Hoai An, Nguyen Quang Thuan, Nguyen Huynh Tuong, Pham Dinh Tao: "Solving the earliness tardiness scheduling problem by DC programming and DCA".

Abstract: Time-index formulation for the earliness tardiness scheduling problem has received a great attention from many researchers because lower bound obtained by linear relaxation is rather good. Much work is devoted to tackle its upper bound. In this paper, we consider this formulation by additionally proposing a deadline for each job. We also propose an approach based on DC (Difference of Convex functions) programming and DCA (DC Algorithm) to find upper bound efficiently for this problem. The results obtained are promising.

 

Keywords: not found.

 

Citation: Le Thi Hoai An, Nguyen Quang Thuan, Nguyen Huynh Tuong, Pham Dinh Tao, Solving the earliness tardiness scheduling problem by DC programming and DCA, Mathematica Balkanica, Vol. 23, Fasc. 3-4, pp. 271-288, 2009.

 

Download link