Back to Search
Start Over
A memetic algorithm for minimizing the total weighted completion time on a single machine under linear deterioration
- Source :
-
Applied Mathematical Modelling . Oct2010, Vol. 34 Issue 10, p2910-2925. 16p. - Publication Year :
- 2010
-
Abstract
- Abstract: In this paper, we consider the problem of minimizing the total weighted completion time on a single machine. Jobs processing times are increasing linear function of start times. First, we present some new dominance properties for this NP-hard problem. And next, using these properties, we develop a memetic algorithm for the problem. The results of computational experiments show the good performance of the proposed algorithm. [Copyright &y& Elsevier]
Details
- Language :
- English
- ISSN :
- 0307904X
- Volume :
- 34
- Issue :
- 10
- Database :
- Academic Search Index
- Journal :
- Applied Mathematical Modelling
- Publication Type :
- Academic Journal
- Accession number :
- 50735943
- Full Text :
- https://doi.org/10.1016/j.apm.2010.01.002