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 - Archive ouverte HAL Access content directly
Journal Articles Computers and Operations Research Year : 2012

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

(1) , (1) , (2)
1
2

Abstract

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|rj|∑Cj1|rj|∑Cj, 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|rj|∑Cj1|rj|∑Cj 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.
Not file

Dates and versions

hal-01003845 , version 1 (10-06-2014)

Identifiers

Cite

Mohammed Ali Rakrouki, Talel Ladhari, Vincent t'Kindt. 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. Computers and Operations Research, 2012, 39 (6), pp.1257-1264. ⟨10.1016/j.cor.2010.12.007⟩. ⟨hal-01003845⟩
37 View
0 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More