توجه: محتویات این صفحه به صورت خودکار پردازش شده و مقالههای نویسندگانی با تشابه اسمی، همگی در بخش یکسان نمایش داده میشوند.
اطلاعات انتشار: سیزدهیمن کنفرانس مهندسی برق ایران، سال ۱۳۸۴
تعداد صفحات: ۶
In this paper, a semi–analytical method has been proposed for the full–wave modal analysis of optical waveguides. In the first step, the dielectric waveguide is periodically repeated in one transverse coordinate direction with an arbitrary period. The resulting periodic structure is analyzed for determination of various mode properties. If the period assumes large values, the modes of the periodic structure approach those of the original waveguide. As it will be demonstrated, the full–wave modal analysis of the aforementioned periodic structure can be performed by extraction of natural frequencies of an equivalent network of ideal coupled transmission lines (TL).<\div>
۲Customer Relationship Termination Problem for Beta–Geometric\Beta–Binomial Model of Customer Behavior
اطلاعات انتشار: Iranian Journal Of Operations Research، سوم،شماره۲، ۲۰۱۲، سال ۰
تعداد صفحات: ۱۱
We deal with the relationship termination problem in the context of individual–level customer relationship management (CRM) and use a Markov decision process to determine the most appropriate occasion for termination of the relationship with a seemingly unprofitable customer. As a particular case, the beta–geometric\beta–binomial model is considered as the basis to define customer behavior and it is explained how to compute customer lifetime value when one needs to take account of the firm’s choice as to whether to continue or terminate relationship with unprofitable customers. By numerical examples provided by simulation, it is shown how a stochastic dynamic programming approach can be adopted in order to obtain a more precise estimation of the customer lifetime value as a key criterion for resource allocation in CRM.
اطلاعات انتشار: Iranian Journal Of Operations Research، چهارم،شماره۱، ۲۰۱۳، سال ۰
تعداد صفحات: ۱۶
We consider criticality in project networks having imprecise activity duration times. It is well known that finding all possibly critical paths of an imprecise project network is an NP–hard problem. Here, based on a method for finding critical paths of crisp networks by using only the forward recursion of critical path method, for the first time an algorithm is proposed which can find all possibly critical paths of interval–valued project networks. The proposed algorithm considers interactivity among paths which has not been yet considered in the fuzzy project scheduling literature. The extension of the proposed algorithm to the fuzzy network calculates criticality degrees of activities and paths of projects without any need to enumerate all project paths. Although algorithms for calculating criticality degrees in fuzzy networks have been previously proposed, despite the fact that they mostly consider a specific type of fuzzy numbers as activity duration times, the exiting algorithms do not discriminate possibly critical paths before calculating the criticality degrees. The computational experience on a series of well–known project samples confirms the algorithm to be remarkably more efficient than similar algorithms for fuzzy networks.
نمایش نتایج ۱ تا ۳ از میان ۳ نتیجه