Search tree based approaches for parallel machine scheduling

Search tree based approaches for parallel machine scheduling

0.00 Avg rating0 Votes
Article ID: iaor2009980
Country: United Kingdom
Volume: 35
Issue: 4
Start Page Number: 1127
End Page Number: 1137
Publication Date: Apr 2008
Journal: Computers and Operations Research
Authors: , ,
Keywords: programming: branch and bound
Abstract:

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 method, in a limited discrepancy search, in a branch-and-greed method or in a beam search.

Reviews

Required fields are marked *. Your email address will not be published.