Journal
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
Volume 207, Issue 3, Pages 1221-1226Publisher
ELSEVIER
DOI: 10.1016/j.ejor.2010.05.050
Keywords
Scheduling; Single machine; Weighted completion rime variance; Lower bound; Heuristic
Ask authors/readers for more resources
We consider a single machine scheduling problem to minimize the weighted completion time variance. This problem is known to be NP-hard. We propose a heuristic and a lower bound based on job splitting and the Viswanathkumar and Srinivasan procedure. The test on more than 2000 instances shows that this lower bound is very tight and the heuristic yields solutions very close to optimal ones since the gap between the solution given by the heuristic and the lower bound is very small. (C) 2010 Published by Elsevier B.V.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available