Coupling Genetic Local Search and Recovering Beam Search algorithms for minimizing the total completion time in the single machine scheduling problem subject to release dates
In this paper we consider the well-known single machine scheduling problem with release dates and minimization of the total job completion time. For solving this problem, denoted by 1 | r j | ∑ C j , we provide a new metaheuristic which is an extension of the so-called filtered beam search proposed...
Saved in:
| Published in: | Computers & operations research Vol. 39; no. 6; pp. 1257 - 1264 |
|---|---|
| Main Authors: | , , |
| Format: | Journal Article |
| Language: | English |
| Published: |
New York
Elsevier Ltd
01.06.2012
Elsevier Pergamon Press Inc |
| Subjects: | |
| ISSN: | 0305-0548, 1873-765X, 0305-0548 |
| Online Access: | Get full text |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Be the first to leave a comment!