带有回报计划的动态客户关系管理模型及实验应用分析

在客户最大化效用及公司最大化CLV的动态环境下。对所提的带有回报计划的动态客户关系管理模型用于某超市的客户数据库中，发现模型的结果对这类客户是适用的。并给出了不同的客户状态空间对应的有效营销组合策略。结果表明：合适的回报计划可以促进客户的购买、提高公司的利润及缓解价格竞争。回报极限应该比客户的平均购买水平偏高，回报率应该与回报极限的改变方向一致。计划的时间范围应定在一年左右比较合适。对于累积购买水平较高的客户一般不邮寄商品信息。在回报计划的初期与末期不用打折。中期对那些购买次数很少的客户可以实行相应的降价策略。     

基于遗传算法和指标满意度求解的第三方物流企业物流中心选址方法

本利用AHP和模糊综合评价法评价物流中心选址的定性指标、用量化选址模型结合遗传算法计算定量指标，再藉助指标满意度求解把定性和定量的指标进行综合，从而为决策对物流中心选址做出科学的决策提供支持。     

On the distribution of the number of retrials

We consider queuing systems where customers are not allowed to queue, instead of that they make repeated attempts, or retrials, in order to enter service after some time. We obtain the distribution of the number of retrials produced by a tagged customer, until he finds an available server.     

一种求解混合多目标规划问题的功效函数法

逻辑生长函数相对于龚珀兹生长函数具有拐点高和对称性的特点,采用逻辑生长函数形式的功效函数法求解混合多目标规划问题具有形式简单、计算量小、符合实际的优点。证明了用这种方法求出的最优解是有效解。讨论了满意值对有效解的影响。逻辑生长函数还可以应用于多维变量评价的功效系数法中。     

Communication Roles, Perceived Effectiveness, and Satisfaction in an Environmental Management Program

Earlier research has shown a relationship between various forms of structural centrality and perceived leadership and role satisfaction in small experimental groups. The limited amount of research on this topic in naturally occurring social networks has yielded results that often conflict with one another. Different results have generally been attributed to possible differences in task environments. This paper examines the relationship between two types of structural centrality and perceived influence, role satisfaction, and perceived effectiveness in an environmental resource management program. Findings in this paper suggest that the observed differences in relationships between the network and other variables is partly a function of global network properties (e.g., marginality of subgroups) and related task environments. This revised version was published online in August 2006 with corrections to the Cover Date.     

基于网络文本挖掘的生态旅游满意度评价研究

科学的游客满意度评价有助于生态旅游的可持续发展。随着Web 2.0技术的发展,在线旅游评论已成为游客满意度研究的重要数据来源。本文以扎龙国家级自然保护区为例,基于在线旅游评论数据和网络文本挖掘技术,构建游客满意度评价指标体系和评价模型,定量评价游客的生态旅游满意度。结果表明:游客总体满意度为0.614,达到基本满意水平。研究不仅为准确评价生态旅游目的地的游客满意度提供新视角,也为相关生态旅游政策的制定提供参考。     

A review ofL=λW and extensions

A fundamental principle of queueing theory isL=W (Little's law), which states that the time-average or expected time-stationary number of customers in a system is equal to the product of the arrival rate and the customer-average or expected customer-stationary time each customer spends in the system. This principle is now well known and frequently applied. However, in recent years there have been extensions, such as H=G and the continuous, distributional, ordinal and central-limit-theorem versions, which show that theL=W relation, when viewed properly, has much more power than was previously realized. Moreover, connections have been established between H=G and other fundamental relations, such as the rate conservation law and PASTA (Poisson arrivals see time averages), which show that there is a much greater unity in the overall theory than was previously realized. This paper provides a review.This paper is dedicated to the memory of our colleague Professor Peter Franken (1937–1989), who contributed greatly to the subject of this paper and to queueing theory more generally.     

Single Machine Batch Scheduling Problem with Resource Dependent Setup and Processing Time in the Presence of Fuzzy Due Date

We consider a batch scheduling problem on a single machine which processes jobs with resource dependent setup and processing time in the presence of fuzzy due-dates given as follows:1. There are n independent non-preemptive and simultaneously available jobs processed on a single machine in batches. Each job j has a processing time and a due-date.2. All jobs in a batch are completed together upon the completion of the last job in the batch. The batch processing time is equal to the sum of the processing times of its jobs. A common machine setup time is required before the processing of each batch.3. Both the job processing times and the setup time can be compressed through allocation of a continuously divisible resource. Each job uses the same amount of the resource. Each setup also uses the same amount of the resource.4. The due-date of each job is flexible. That is, a membership function describing non-decreasing satisfaction degree about completion time of each job is defined.5. Under above setting, we find an optimal batch sequence and resource values such that the total weighted resource consumption is minimized subject to meeting the job due-dates, and minimal satisfaction degree about each due-date of each job is maximized. But usually we cannot optimize two objectives at a time. So we seek non-dominated pairs i.e. the batch sequence and resource value, after defining dominance between solutions.A polynomial algorithm is constructed based on linear programming formulations of the corresponding problems.     

Consecutive customer losses in oscillating GIX/M//n systems with state dependent services rates

We address the probability that k or more Consecutive Customer Losses take place during a busy period of a queue, the so-called k-CCL probability, for oscillating GI ^X /M//n systems with state dependent services rates, also denoted as GI ^X /M(m)−M(m)//n systems, in which the service rates oscillate between two forms according to the evolution of the number of customers in the system. We derive an efficient algorithm to compute k-CCL probabilities in these systems starting with an arbitrary number of customers in the system that involves solving a linear system of equations. The results derived are illustrated for specific sets of parameters.     

Consecutive customer losses in regular and oscillating <Emphasis Type="Italic">M</Emphasis><Superscript><Emphasis Type="Italic">X</Emphasis></Superscript>/<Emphasis Type="Italic">G</Emphasis>/1/<Emphasis Type="Italic">n</Emphasis> systems

We derive fast recursions to compute the probability that k or more consecutive customer losses take place during a busy period of a queue, the so called k-CCL probability, for regular and oscillating M ^X /G/1/n systems.