The multi-item capacitated lot-sizing problem with setup times and shortage costs

We address a multi-item capacitated lot-sizing problem with setup times and shortage costs that arises in real-world production planning problems. Demand cannot be backlogged, but can be totally or partially lost. The problem is NP-hard. A mixed integer mathematical formulation is presented. Our approach in this paper is to propose some classes of valid inequalities based on a generalization of Miller et al. [A.J. Miller, G.L. Nemhauser, M.W.P. Savelsbergh, On the polyhedral structure of a multi-item production planning model with setup times, Mathematical Programming 94 (2003) 375–405] and Marchand and Wolsey [H. Marchand, L.A. Wolsey, The 0–1 knapsack problem with a single continuous variable, Mathematical Programming 85 (1999) 15–33] results. We also describe fast combinatorial separation algorithms for these new inequalities. We use them in a branch-and-cut framework to solve the problem. Some experimental results showing the effectiveness of the approach are reported.     

Quantifying the value of buyer–vendor coordination: Analytical and numerical results under different replenishment cost structures

Despite a growing interest in channel coordination, no detailed analytical or numerical results measuring its impact on system performance have been reported in the literature. Hence, this paper aims to develop analytical and numerical results documenting the system-wide cost improvement rates that are due to coordination. To this end, we revisit the classical buyer–vendor coordination problem introduced by Goyal [S.K. Goyal, An integrated inventory model for a single-supplier single-customer problem. International Journal of Production Research 15 (1976) 107–111] and extended by Toptal et al. [A. Toptal, S. Çetinkaya, C.-Y. Lee, The buyer–vendor coordination problem: modeling inbound and outbound cargo capacity and costs, IIE Transactions on Logistics and Scheduling 35 (2003) 987–1002] to consider generalized replenishment costs under centralized decision making. We analyze (i) how the counterpart centralized and decentralized solutions differ from each other, (ii) under what circumstances their implications are similar, and (iii) the effect of generalized replenishment costs on the system-wide cost improvement rates that are due to coordination. First, considering Goyal’s basic setting, we show that the improvement rate depends on cost parameters. We characterize this dependency analytically, develop analytical bounds on the improvement rate, and identify the problem instances in which considerable savings can be achieved through coordination. Next, we analyze Toptal et al.’s [A. Toptal, S. Çetinkaya, C.-Y. Lee, The buyer–vendor coordination problem: modeling inbound and outbound cargo capacity and costs, IIE Transactions on Logistics and Scheduling 35 (2003) 987–1002] extended setting that considers generalized replenishment costs representing inbound and outbound transportation considerations, and we present detailed numerical results quantifying the value of coordination. We report significant improvement rates with and without explicit transportation considerations, and we present numerical evidence which suggests that larger rates are more likely in the former case.     

Optimal hedging strategies for multi-period guarantees in the presence of transaction costs: A stochastic programming approach

Multi-period guarantees are often embedded in life insurance contracts. In this paper we consider the problem of hedging these multi-period guarantees in the presence of transaction costs. We derive the hedging strategies for the cheapest hedge portfolio for a multi-period guarantee that with certainty makes the insurance company able to meet the obligations from the insurance policies it has issued. We find that by imposing transaction costs, the insurance company reduces the rebalancing of the hedge portfolio. The cost of establishing the hedge portfolio also increases as the transaction cost increases. For the multi-period guarantee there is a rather large rebalancing of the hedge portfolio as we go from one period to the next. By introducing transaction costs we find the size of this rebalancing to be reduced. Transaction costs may therefore be one possible explanation for why we do not see the insurance companies performing a large rebalancing of their investment portfolio at the end of each year.     

高校教育成本测算及其优化管理模型

在高校成本层次分类的基础上,建立了生均成本测算的一般模型,针对教育成本投入过程中因学生人数随机变化而存在的风险,引进教学质量函数,提出了办学效益和教学质量的双目标优化模型.利用凸分析和优化原理得到优化问题解的存在性,全部正解的β取值范围以及最优解满足的充要条件,对最优解的定量计算给出了基于Monte Carlo模拟的遗传算法设计,并进行了相应的经济意义分析.     

新会计准则融资租赁会计处理探讨

新会计准则规定在融资租赁情况下,应运用总额法把出租人的初始直接费用计入应收融资租赁款进行资本化,该处理方法存在逻辑上的错误.本文通过分析美国会计准则与国际会计准则相关的会计处理方法,指出此错误的原因,并建议我国应借鉴国际会计准则的资产负债观,运用净值法处理出租人的融资收益.     

用模糊优化方法进行配电网重构

网络重构是配电系统运行和控制的重要手段,它通过改变线路开关的状态来变换网络结构.为实现配电网安全、稳定运行, 采用模糊优化的方法实现网络重构.在供需平衡的前提下,满足容量和电压等约束,实现了减少网络的运行损耗.且通过一个32节点网络系统算例验证了可行性.     

基于信息技术的企业组织激励研究

通过将信息技术水平系数纳入到委托代理模型中,创新地建立了基于信息技术的企业组织激励模型,模型分析结果表明,简单组织中监督系统的信息技术水平越高,底层员工报酬合同的激励作用越显著,复杂组织中,随着信息技术水平的提高,底层员工报酬合同的激励作用也增强,而中层管理者的激励作用会因为风险传递效应的存在而呈现出先增强后减弱的变化趋势,通过对组织代理成本的分析可知,在信息技术水平较低和较高时,简单组织和复杂组织分别具有“激励优势。”。     

不同轴限下运行费用的对比分析

根据有关统计和预测资料，分别建立了轴限为１０ｔ和１３ｔ下的轴重分布模型。在此基础上采用线性插值的方法，获得了轴限为１１ｔ和１２ｔ下的轴重分布模型。最后依据运行费用模型和分析时期的材料价格，对４种轴限下的运行费用进行了对比分析。     

会计信息失真的经济学成因及治理对策

分析会计信息失真的经济学成因，提出治理会计信息失真的对策，以达到为决策者提供真实、可靠的会计信息，降低决策风险的目的。     

On the evaluation of fixed permutations as strategies in stochastic scheduling

A general model is proposed for the stochastic version of the single-machine allocation problem. Sufficient conditions are given to ensure that there is an optimal strategy given by a fixed permutation of the job set. Additional results are given for an important special case of the general model involving simple jobs. The paper concludes with material concerning the evaluation of fixed permutations as strategies under conditions more general than the sufficient conditions mentioned above.