Read the full-text of this article for free

Title: Solving the Repeated Partition Scheduling Problem Using Metaheuristics

Authors: Zvi Goldstein; Zvi Drezner

Addresses: Author address listing can be found in the "About the Authors" section at the end of the article.

Abstract: In this paper we solve the repeated partition scheduling problem by the three metaheuristics: simulated annealing, tabu search, and genetic algorithms. The procedures are described and particular parameters for each of the procedures are established. Computational experiments on twenty-two test problems show that the best procedure is the tabu search.

Keywords: Repeated partition scheduling; metaheuristics; simulated annealing; tabu search; genetic algorithms.

DOI: 10.1504/JBM.2007.141149

Journal of Business and Management, 2007 Vol.13 No.1, pp.37 - 55

Published online: 05 Sep 2024 *