Paper Info
Title
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.
Year
DOI
Venue
2009
10.1109/IMCSIT.2009.5352753
IMCSIT
Keywords
Field
DocType
dca programing,linear relaxation,scheduling,relaxation theory,dc programming,upper bound efficiently,convex programming,earliness tardiness scheduling,time indexed formulation,algorithm theory,convergence,convex function,indexation,lower bound,data mining,upper bound,scheduling problem,programming,optimization,computational modeling
Convergence (routing),Mathematical optimization,Tardiness,Job shop scheduling,Computer science,Scheduling (computing),Upper and lower bounds,Algorithm,Convex function,Dc programming,Convex optimization
Conference
ISBN
Citations 
PageRank 
978-1-4244-5314-6
0
0.34
References 
Authors
12
4
Name
Order
Citations
PageRank
Le Thi Hoai An1103880.20
Quang Thuan Nguyen2102.93
Nguyen Huynh Tuong3514.60
Pham Dinh Tao41340104.84