考虑互惠公平的创新顾客激励契约研究

基于公平偏好理论的互惠公平,从创新顾客的互惠偏好程度、激励契约类型与激励效果的关系入手,构建创新顾客参与企业创新活动的激励模型。通过模型求解和分析,探讨激励契约的外部性和互惠关系对于激励效果的影响;此外,进一步分析如何联合经济激励和心理激励,降低企业获得创新顾客高努力投入的成本;最后,通过仿真实验,验证模型分析结果。研究发现:当创新顾客之间出现互惠关系时,最优激励契约取决于创新顾客心理偏好与风险态度之间的相互作用:当创新顾客的风险规避程度较低时,最优激励契约为相对绩效契约;当创新顾客的风险规避程度较高时,最优激励契约为团队报酬契约。     

An <Emphasis Type="Italic">M</Emphasis><Superscript>[<Emphasis Type="Italic">X</Emphasis>]</Superscript>/<Emphasis Type="Italic">G</Emphasis>/1 retrial queue with server breakdowns and constant rate of repeated attempts

We consider an M ^[X]/G/1 retrial queue subject to breakdowns where the retrial time is exponential and independent of the number of customers applying for service. If a coming batch of customers finds the server idle, one of the arriving customers begins his service immediately and the rest joins a retrial group (called orbit) to repeat his request later; otherwise, if the server is busy or down, all customers of the coming batch enter the orbit. It is assumed that the server has a constant failure rate and arbitrary repair time distribution. We study the ergodicity of the embedded Markov chain, its stationary distribution and the joint distribution of the server state and the orbit size in steady-state. The orbit and system size distributions are obtained as well as some performance measures of the system. The stochastic decomposition property and the asymptotic behavior under high rate of retrials are discussed. We also analyse some reliability problems, the k-busy period and the ordinary busy period of our retrial queue. Besides, we give a recursive scheme to compute the distribution of the number of served customers during the k-busy period and the ordinary busy period. The effects of several parameters on the system are analysed numerically. I. Atencia’s and Moreno’s research is supported by the MEC through the project MTM2005-01248.     

A Solution Method for a Two-dispatch Delivery Problem with Stochastic Customers

We study a vehicle routing problem in which vehicles are dispatched multiple times a day for product delivery. In this problem, some customer orders are known in advance while others are uncertain but are progressively realized during the day. The key decisions include determining which known orders should be delivered in the first dispatch and which should be delivered in a later dispatch, and finding the routes and schedules for customer orders. This problem is formulated as a two-stage stochastic programming problem with the objective of minimizing the expected total cost. A worst-case analysis is performed to evaluate the potential benefit of the stochastic approach against a deterministic approach. Furthermore, a sample-based heuristic is proposed. Computational experiments are conducted to assess the effectiveness of the model and the heuristic.      

负顾客可服务的M/G/1可修排队

负顾客的M/G/1排队模型研究工作可从不同的角度、不同的方法、不同的机制来进行.文中将负顾客和可修系统结合起来,研究了一类负顾客的M/G/1可修排队系统.服务规则是后到先服务,负顾客抵消正顾客且可接受服务,而且正顾客也可抵消负顾客.使用"补充变量法"和状态转移方程分析该模型,得到了一系列的排队指标和可靠性指标,并给出了数值迭代方法.     

Flow equivalence and stochastic equivalence in G-networks

G-networks are novel product form queuing networks that, in addition to ordinary customers, contain unusual entities such as negative customers which eliminate normal customers, and triggers that move other customers from some queue to another. Recently we introduced one more special type of customer, a reset, which may be sent out by any server at the end of a service epoch, and that will reset the queue to which it arrives into its steady state when that queue is empty. A reset which arrives to a non-empty queue has no effect at all. The sample paths of a system with resets is significantly different from that of a system without resets, because the arrival of a reset to an empty queue will provoke a finite positive jump in queue length which may be arbitrarily large, while without resets positive jumps are only of size + 1 and they occur only when a positive customer arrives to a queue. In this paper we review this novel model, and then discuss its traffic equations. We introduce the concept of stationary equivalence for queueing models, and of flow equivalence for distinct queueing models. We show that the flow equivalence of two G-networks implies that they are also stationary equivalent. We then show that the stationary probability distribution of a G-network with resets is identical to that of a G-network without resets whose transition probabilities for positive (ordinary) customers has been increased in a specific manner. Our results show that a G-network with resets has the same form of traffic equations and the same joint stationary probability distribution of queue length as that of a G-network without resets.     

具有交期约束的非同质顾客并行机竞争调度

考虑面向具有交期要求的非同质顾客的并行机调度问题,其中,不同顾客具有不同等待敏感程度,且具有各自的交期约束.为此,采用非合作博弈建立描述该问题的模型,并提出一种包含松弛、可行化和交互协调三步的启发式算法.算例仿真进一步阐述和验证所提方法的有效性.     

具有可变输入率和不耐烦顾客M/M/n的排队模型

陆传赉在文献[1]中研究了当系统中的队长为r时,新来的顾客以概率αr=1/(r+1)或αr=1/(r+1)-1/(r+2)加入系统,即输入率为λr=λαr,服务率为μ的可变输入率的M/M/1排队模型;以及当排队等待的队长为r时,不耐烦顾客离开队伍的强度为△r=rδ(δ≥0)的具有不耐烦顾客的M/M/n排队模型;并得到了...     

基于k-means和邻域粗糙集的航空客户价值分类研究

对客户价值进行分类, 识别重要价值客户, 对航空公司获利至关重要。本文提出了基于k-means和邻域粗糙集的航空客户价值分类模型。首先, 从客户的当前价值和潜在价值双视角出发, 建立了航空客户综合价值评价指标体系; 之后, 采用基于Elbow的k-means方法对航空客户进行聚类, 采用邻域粗糙集方法对决策系统进行指标约简, 根据约简后的决策系统完成客户价值初筛。评估前先使用SMOTE方法消除数据的不平衡性, 而后采用网格搜索组合分类器的方法对航空客户价值分类的效果进行评估和检验。最后, 根据评估结果对航空客户价值细分。文末, 对国内某航空公司的62988条真实客户记录进行了实证分析和验证, 其中, 潜在VIP客户群的分类准确率达到了92%, 从而为航空客户价值分类提供了一种新思路。     

考虑消费者忠诚的雇员激励契约设计

在信息不对称条件下,企业雇主如何在员工行为无法被观测到的情况下达到最优绩效成为企业上层需要解决的重要问题。在此背景下,区别于既有文献,本文根据服务型企业以消费者为中心的特点,将消费者忠实度纳入委托——代理模型,通过设计企业激励契约机制,探讨了企业雇佣员工的最佳方式。结果表明:(1)长期稳定工作的员工会选择提成工资制,这类员工倾向于将努力水平用于提高消费者忠诚度,其选择的结果能为企业带来利润;(2)短期非稳定工作的员工选择固定工资制,这类员工的零付出将给企业造成亏损,且损失额即为短期非稳定员工的固定工资额;(3)选择提成工资制的员工将给服务型企业带来正效益,而选择固定工资制的员工给企业带来固定工资的损失额。本文从企业雇佣员工方式的角度,为企业更偏向于为直接面对消费者创造业绩的服务型员工采取提成工资制,而为没有直接面对消费者的非服务型员工采用固定工资制提供了一种解释,有助于把握企业管理的着力点,进而增强企业绩效提升对经济发展的推动性作用。     

带有负顾客且具有反馈的M/M/1/N工作休假排队

研究带反馈的且具有正、负两类顾客的M/M/1/N工作休假排队模型.工作休假策略为空竭服务多重工作休假.负顾客一对一抵消队首正在接受服务的正顾客(若有),若系统中无正顾客时,到达的负顾客自动消失,负顾客不接受服务.完成服务的正顾客以概率p(0相似文献