Balanced constrained partitioning of distinct objects

Title

Balanced constrained partitioning of distinct objects

Creator

Kureethara J.V.; Biswas J.; Samanta D.; Eapen N.G.

Description

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. BEIESP.

Source

International Journal of Innovative Technology and Exploring Engineering, Vol-8, No. 11 Special Issue, pp. 104-106.

Date

2019-01-01

Publisher

Blue Eyes Intelligence Engineering and Sciences Publication

Coverage

Kureethara J.V., Christ (Deemed to be University), Bengaluru, Karnataka, India; Biswas J., Department of Computer Science, Christ (Deemed to be University), Bengaluru, Karnataka, India; Samanta D., Department of Computer Science, Christ (Deemed to be University), Bengaluru, Karnataka, India; Eapen N.G., Department of Computer Science, Christ (Deemed to be University), Bengaluru, Karnataka, India

Rights

All Open Access; Gold Open Access

Relation

ISSN: 22783075

Format

Online

Language

English

Type

Article

Identifier

https://doi.org/10.35940/ijitee.K1023.09811S19

https://www.scopus.com/inward/record.uri?eid=2-s2.0-85073523813&doi=10.35940%2fijitee.K1023.09811S19&partnerID=40&md5=e78f669e12e59cf64008bd0d8463e98c