A Modified Approach for Bi-Criterion Call Center Problem
| dc.contributor.author | Chhabra, Kavita | |
| dc.contributor.supervisor | Sharma, Mahesh Kumar | |
| dc.date.accessioned | 2012-09-08T07:34:03Z | |
| dc.date.available | 2012-09-08T07:34:03Z | |
| dc.date.issued | 2012-09-08T07:34:03Z | |
| dc.description.abstract | The present work deals with the problem of selecting sites for setup of call centers from among a given number of potential sites for assigning a given number of zones of call origin to them. The two objectives without being prioritized with several constraints are considered. The objectives are to minimize the total call charges and total call centers setup costs with the several constraints that each zone is assigned to a unique site at which a call center is setup and call centers at different potential sites have different capacities. There is no restriction in the number of zones to be assigned to a call center as long as its capacity is not exceeded. The present thesis consists of three chapters. Chapter 1 is introducing in nature in which the concept of multi-objective optimization has been discussed. Also the literature related to the work presented in this chapter. In chapter 2, a bi-criterion call center problem through an evolved branch and bound algorithm ( Prakash et. al. (2011) ) has been reviewed. In chapter 3, a simple procedure to find efficient solutions has been developed by modifying the existing approach. | en |
| dc.format.extent | 1370027 bytes | |
| dc.format.mimetype | application/pdf | |
| dc.identifier.uri | http://hdl.handle.net/10266/1986 | |
| dc.language.iso | en | en |
| dc.subject | Bi-criterion optimization | en |
| dc.subject | Non-dominated solutions | en |
| dc.subject | Branch and bound algorithm | en |
| dc.subject | Clustering | en |
| dc.subject | Call center | en |
| dc.title | A Modified Approach for Bi-Criterion Call Center Problem | en |
| dc.type | Thesis | en |