Abstract
This paper considered the single machine scheduling problem with unequal release dates so as to minimize total completion times. This problem was proved to be as an NP-hard problem. Traditional heuristics for the problem were analyzed, and then we presented an improved algorithm. A numerical example and its computational result were given. The performance of the algorithm was also analyzed by experiments and the experimental results show that the algorithm is more effective than the existing heuristics.
| Original language | English |
|---|---|
| Pages (from-to) | 929-932 |
| Number of pages | 4 |
| Journal | Zhongguo Jixie Gongcheng/China Mechanical Engineering |
| Volume | 19 |
| Issue number | 8 |
| State | Published - 25 Apr 2008 |
Keywords
- Heuristic algorithm
- Release date
- Single machine scheduling
- Total completion times