Abstract
This work presents a parallel object-oriented tabu search (TS) algorithm for static task scheduling. The scheduling problem and the TS method are separately modeled under an object-oriented approach. The TS parallelization follows a strategy based on multi-search threads and the algorithm is fully implemented using the Java language. Besides providing a new scheduling algorithm, this work contributes to demonstrate: the strength of object-orientation also in this field of applications; the adaptability of TS to asynchronous parallelization; the significance of diversification in TS algorithms; and the potential of the Java language in implementing highly portable object-oriented parallel software.
Published Version
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call