Hoai An Le Thi, Nguyen Quang Thuan, Nguyen Huynh Tuong, Pham Dinh Tao: "A time-indexed formulation of earliness tardiness scheduling via 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: 


Citation: Hoai An Le Thi, Nguyen Quang Thuan, Nguyen Huynh Tuong, Pham Dinh Tao, A time-indexed formulation of earliness tardiness scheduling via DC programming and DCA, Proceedings of the International Multiconference on Computer Science and Information Technology pp. 779–784 ISBN 978-83-60810-22-4 ISSN 1896-7094, 2009.

 

Download link