Balanced Constrained Partitioning of Distinct Objects
Joseph Varghese Kureethara1, Jayanta Biswas2, Debabrata Samanta3, Naived George Eapen4
1Joseph Varghese Kureethara, Professor, Department of Mathematics, Christ Deemed to be University, Bengaluru (Karnataka), India.
2Jayanta Biswas, Department of Computer Science, Christ Deemed to be University, Bengaluru (Karnataka), India.
3Debabrata Samanta, Department of Computer Science, Christ Deemed to be University, Bengaluru (Karnataka), India.
4Naived George Eapen, Department of Computer Science, Christ Deemed to be University, Bengaluru (Karnataka), India.
Manuscript received on 08 September 2019 | Revised Manuscript received on 17 September 2019 | Manuscript Published on 11 October 2019 | PP: 104-106 | Volume-8 Issue-11S September 2019 | Retrieval Number: K102309811S19/2019©BEIESP | DOI: 10.35940/ijitee.K1023.09811S19
Open Access | Editorial and Publishing Policies | Cite | Mendeley | Indexing and Abstracting
© The Authors. Blue Eyes Intelligence Engineering and Sciences Publication (BEIESP). This is an open-access article under the CC-BY-NC-ND license (http://creativecommons.org/licenses/by-nc-nd/4.0/)
Abstract: Partition is the process of dividing η elements of a set into ν non-empty subsets where every element is included in exactly one subset. Set partitioning problems play an important role in real-world scenarios such as scheduling, management and grouping. In this paper, n distinct objects are arranged into different groups and the problem of partition is evaluated concerning a people assignment problem of a multi-site company. New constraints such as minimum and the maximum number of people in a single-site company (respectively m and M) that are fixed for all sites are introduced and the solutions for the partition problem for the constraints are also established.
Keywords: Objects Partitioning Constrained Management Problem.
Scope of the Article: Digital Rights Management