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...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Computers & operations research Ročník 39; číslo 6; s. 1257 - 1264
Hlavní autoři: Rakrouki, Mohamed Ali, Ladhari, Talel, T’kindt, Vincent
Médium: Journal Article
Jazyk:angličtina
Vydáno: New York Elsevier Ltd 01.06.2012
Elsevier
Pergamon Press Inc
Témata:
Algorithms
Comparative analysis
Completion time
Computer Science
Genetic Local Search
Genetic Recovering Beam Search
Genetics
Heuristic
Heuristics
Job shops
Joining
Operations Research
Optimization
Optimization algorithms
Production scheduling
Recovering
Release dates
Scheduling
Searching
Single machine
Studies
Genetic Local Search
Genetic Recovering Beam Search
Release dates
Heuristics
Single machine
ISSN:0305-0548, 1873-765X, 0305-0548
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí: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 by Ow and Morton [30]. This metaheuristic, referred to as a Genetic Recovering Beam Search (GRBS), takes advantages of a Genetic Local Search (GLS) algorithm and a Recovering Beam Search (RBS) in order to efficiently explore the solution space. In this paper we present the GRBS framework and its application to the 1 | r j | ∑ C j problem. Computational results show that it consistently yields optimal or near-optimal solutions and that it provides interesting results by comparison to GLS and RBS algorithms. Moreover, these results highlight that the proposed algorithm outperforms the state-of-the-art heuristics.
Bibliografie:SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ObjectType-Article-2
content type line 23
ISSN:0305-0548
1873-765X
0305-0548
DOI:10.1016/j.cor.2010.12.007