An O(n2log2n) algorithm for input-or-output test in disjunctive scheduling

An O(n2log2n) algorithm for input-or-output test in disjunctive scheduling

0.00 Avg rating0 Votes
Article ID: iaor20043607
Country: Japan
Volume: 47
Issue: 2
Start Page Number: 112
End Page Number: 122
Publication Date: Jun 2004
Journal: Journal of the Operations Research Society of Japan
Authors: , ,
Keywords: programming: branch and bound
Abstract:

This paper is concerned with the input-or-output test that is a kind of interval capacity consistency test. And an O(n2log2n) algorithm dealing with the test is proposed, where n denotes the number of jobs. In literature, an O(n4) algorithm has been known. The tests can be effectively used to reduce the search space of time- and resource-constrained scheduling problems. Computational results show that our new algorithm is about 3 times faster for instances of 30 jobs than the existing algorithm.

Reviews

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