A memetic algorithm for minimizing the total weighted completion time on a single machine under linear deterioration |
| |
| Authors: | Jalil Layegh Fariborz Jolai |
| |
| Affiliation: | Department of Industrial Engineering, College of Engineering, University of Tehran, Tehran, Iran |
| |
| 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. |
| |
| Keywords: | Scheduling Single machine Linear deterioration Total weighted completion time |
| 本文献已被 ScienceDirect 等数据库收录！ |
