¿¬¼¼´ëÇб³ °æ¿µ¿¬±¸¼Ò

·Î°í & ¹Ù·Î°¡±â

¸ÞÀθ޴º

ÄÁÅÙÃ÷ ³»¿ë ½ÃÀÛ

¿¬±¸È°µ¿

³í¹®
Kim, Seong Moon, ³ªÁ¤Àº,±è¼ö¹Ì.  ÃÖÀûÈ­¿Í ½Ã¹Ä·¹À̼ÇÀ» ÀÌ¿ëÇÑ Äݼ¾ÅÍÀÇ Àη ¹èÄ¡ ¿¬±¸  »ê¾÷°øÇÐ(IE Interfaces)  24  : 40~50
¹ßÇ¥³âµµ: 2011  |  ºÐ¾ß: ODI
We develop a nonlinear integer programming model which minimizes the total cost with the optimalnumber of operators to hire and their optimal allocation to the tasks under the diverse constraints such asthe weekly, daily, and hourly maximum allowable abandonment rates for the time-varying inbound callvolume. We present a case study based on actual data at a call center, in order to prove the validity ofapplying the optimization method proposed. By the one-sample two-tailed t-test, we confirm that theexpected abandonment rates resulting from the optimization method are identical with the ones from thediscrete-event simulation within specified confidence intervals.

ÄÁÅÙÃ÷ ³»¿ë ³¡

¿¬¶ôó ¹× ÀúÀÛ±Ç

ÆäÀÌÁö ·Îµù À̹ÌÁö Ç¥½Ã

ÆäÀÌÁö ·ÎµùÁß ...

ÆäÀÌÁö ·ÎµùÁß ...

x
x