On an extension of the Sort & Search method with application to scheduling theory

In this paper, we focus on the Sort & Search method initially proposed by Horowitz and Sahni (1974)  [6] to solve the knapsack problem, which has already show its applicability to derive exponential-time algorithms for some scheduling problems. We propose an extension of this method to a general...

Full description

Saved in:
Bibliographic Details
Published inTheoretical computer science Vol. 511; pp. 13 - 22
Main Authors Lenté, Ch, Liedloff, M., Soukhal, A., T’Kindt, V.
Format Journal Article
LanguageEnglish
Published Elsevier B.V 04.11.2013
Elsevier
Subjects
Computer Science
Data Structures and Algorithms
Exponential-time algorithms
Operations Research
Scheduling
Sort & Search
Exponential-time algorithms
Sort & Search
Scheduling
Online AccessGet full text

Cover

More Information
Summary:In this paper, we focus on the Sort & Search method initially proposed by Horowitz and Sahni (1974)  [6] to solve the knapsack problem, which has already show its applicability to derive exponential-time algorithms for some scheduling problems. We propose an extension of this method to a general class of problems called Multiple Constraint Problems and show that the extended Sort & Search method enables one to derive new exponential-time algorithms, with O∗(mn2) worst-case complexity, for two scheduling problems.
ISSN:0304-3975
1879-2294
DOI:10.1016/j.tcs.2013.05.023