Search tree based approaches for parallel machine scheduling - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Computers and Operations Research Année : 2008

Search tree based approaches for parallel machine scheduling

Résumé

This article compares two branching schemes for the parallel machine scheduling problem with release dates and tails. Both branching schemes can be used for either complete or incomplete search tree based algorithms. In particular, our study aims to prove the robustness of each of them for several search methods. We experimentally compare the efficiency of the two branching schemes when they are used in a branch-and-bound (BnB) method, in a limited discrepancy search, in a branch-and-greed (BnG) method or in a beam search (BS).

Dates et versions

hal-01022217 , version 1 (10-07-2014)

Identifiants

Citer

Emmanuel Neron, Fabrice Tercinet, Francis Sourd. Search tree based approaches for parallel machine scheduling. Computers and Operations Research, 2008, 35 (4), pp.1127-1137. ⟨10.1016/j.cor.2006.07.008⟩. ⟨hal-01022217⟩
92 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More