Article: On The Repeated Partition Scheduling Problem Journal: Journal of Business and Management (JBM) 1998 Vol.5 No.2 pp.65 - 77 Abstract: In this paper, we present the following scheduling problem. nk people are to be divided into k groups of n people each. Such a division is repeated k times (each time a different partition is scheduled). It is required that each person meets every other person (i.e., is in the same group with him) at least once. The objective is that each person will meet with other participants about the same number of times. The problem is formulated and heuristic algorithms proposed for its solution. Extensive computational experiments are reported. Inderscience Publishers - linking academia, business and industry through research

Title: On The Repeated Partition Scheduling Problem

Authors: 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 present the following scheduling problem. nk people are to be divided into k groups of n people each. Such a division is repeated k times (each time a different partition is scheduled). It is required that each person meets every other person (i.e., is in the same group with him) at least once. The objective is that each person will meet with other participants about the same number of times. The problem is formulated and heuristic algorithms proposed for its solution. Extensive computational experiments are reported.

Keywords: Partition scheduling; scheduling problem; heuristic algorithms; computational experiments.

DOI: 10.1504/JBM.1998.141045

Journal of Business and Management, 1998 Vol.5 No.2, pp.65 - 77

Published online: 05 Sep 2024 *

Title: On The Repeated Partition Scheduling Problem

Keep up-to-date