Lexi-search algorithm for one to many multidimensional bi-criteria unbalanced assignment problem Online publication date: Wed, 13-Nov-2019
by Jayanth Kumar Thenepalle; Purusotham Singamsetty
International Journal of Bio-Inspired Computation (IJBIC), Vol. 14, No. 3, 2019
Abstract: This paper deals with one-to-many multidimensional unbalanced assignment problem with two conflicting objectives, where the first objective minimises the total processing time and the other maximises the overall productivity/profit on performing n jobs by m (m <n) persons at h distinct time horizons. It is assumed that each job is operated by exactly one person, whereas a person is permitted to perform more than one job at distinct time horizons. This problem is modelled with binary programming, and has potential applications in scheduling, timetabling, human resource allocations, etc. An efficient pattern recognition technique-based Lexi-search algorithm (LSA) is developed, which is capable of enumerating the Pareto optimal solutions. A comparative study is performed between the LSA and genetic algorithm (GA) on the relaxed version of the present model. The descriptive statistical analysis of CPU runtime of LSA on distinct random instances indicates that it is taking reasonably less computational runtime.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Bio-Inspired Computation (IJBIC):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com
Our Blog 
Follow us on Twitter 
Visit us on Facebook