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...
Uložené v:
| Vydané v: | Computers & operations research Ročník 39; číslo 6; s. 1257 - 1264 |
|---|---|
| Hlavní autori: | , , |
| Médium: | Journal Article |
| Jazyk: | English |
| Vydavateľské údaje: |
New York
Elsevier Ltd
01.06.2012
Elsevier Pergamon Press Inc |
| Predmet: | |
| ISSN: | 0305-0548, 1873-765X, 0305-0548 |
| On-line prístup: | Získať plný text |
| Tagy: |
Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
|
Buďte prvý, kto okomentuje tento záznam!