A survey of berth allocation and quay crane scheduling problems in container terminals

Due to the variety of technical equipments and terminal layouts, research has produced a multitude of optimization models for seaside operations planning in container terminals. To provide a support in modeling problem characteristics and in suggesting applicable algorithms this paper reviews the relevant literature. For this purpose new classification schemes for berth allocation problems and quay crane scheduling problems are developed. Particular focus is put on integrated solution approaches which receive increasing importance for the terminal management.     

纳税最优的工资奖金分配方案研究

根据我国现行的税法,个人所得税纳税采用九级累进税率.年工资和年终奖在速算扣除数个数上存在不同,使得对于相同的税前年收入,如果采用不同的年工资和年终奖分配方案会产生不同的税后实际所得.通过简化变量和缩小有效解区域,以及一系列严格的数学推导,得到了任意年收入下,月工资和年终奖的最优分配方案,使得在现有税制下,纳税额最小,税后收入最大.这个最优方案避免了税金负效应现象,保证了纳税公平性,有利于国家税务监管,企业员工薪金分配和个人纳税筹划;具有广阔的应用前景.     

A rule for slack allocation proportional to the duration in a PERT network

In this paper, we define a new rule for the resolution of the slack allocation problem in a PERT network. This problem exists of allocating existing extra time in some paths among the activities belonging to those paths. The allocation rule that we propose assigns extra time to the activities proportionally to their durations in such a way that no path duration exceeds the completion time of the whole project. This time allocation enables us to make a schedule for the PERT project under study. We give two characterizations of the rule and we compare it with others that have been previously defined in the literature.     

具有销售成本的小额信贷模型

首先剖析了我国小额贷款实践的现状和存在的问题,通过理论和数学模型分析,指出信贷约束本身并不是贫困产生和持续的充分条件.由于农户存在产品销售成本带来的销售规模效应给农户的贫困的影响及其对农村小额信贷项目的影响,过低的贷款额度可能会使得小额贷款项目对农户失去吸引力,造成小额贷款需求萎缩.因此,适当扩大小额贷款的额度限制,有利于农户更加积极地参与到小额贷款项目中,通过正当经营,增加收入,从而提高生活水平.     

A note on coalitional manipulation and centralized inventory management

In this note we deal with inventory games as defined in Meca et al. (Math. Methods Oper. Res. 57:483–491, 2003). In that context we introduce the property of immunity to coalitional manipulation, and demonstrate that the SOC-rule (Share the Ordering Cost) is the unique allocation rule for inventory games which satisfies this property. The authors acknowledge the financial support of Ministerio de Educación y Ciencia, FEDER and Xunta de Galicia through projects SEJ2005-07637-C02-02 and PGIDIT06PXIC207038PN.     

改进的最小费用理论在盲竖井选址中的应用

在网络的任意点求解绝对中心等特殊点是网络流研究的一个难点.在目前最小费用理论的基础上引入平面几何理论,把网络等效于几何图形,建立了数学模型.通过求解,得出了网络间的最佳连接点,从而确定出盲竖井的位置.最后以云南锡业集团个旧东区两个生产平台之间的连接为一算例,得出了理想的结果,验证了该方法的有效可行性.     

Partial integration of frequency allocation within antenna positioning in GSM mobile networks

In this article we propose to partially integrate the antenna positioning (APP) and frequency allocation problems (FAP). The traditional wireless network design process examines these two major issues sequentially in order to avoid the very high complexity associated with the simultaneous resolution of the two problems. The proposed integration involves the introduction of interference protection guarantees within the APP. It is customary to define such guarantees in an intermediate step and to use them as input to FAP, in order to protect against interference in critical areas. The proposed approach consists of selecting these protections while solving the APP, allowing the optimization procedure to exploit the degrees of freedom that this would offer. Results on two real-life problem instances indicate a significant improvement in interference levels and resource utilization.     

Variable neighborhood search for minimum cost berth allocation

The berth allocation problem is to allocate space along the quayside to incoming ships at a container terminal in order to minimize some objective function. We consider minimization of total costs for waiting and handling as well as earliness or tardiness of completion, for all ships. We assume ships can arrive at any given time, i.e., before or after the berths become available. The resulting problem, which subsumes several previous ones, is expressed as a linear mixed 0–1 program. As it turns out to be too time-consuming for exact solution of instances of realistic size, a Variable Neighborhood Search (VNS) heuristic is proposed, and compared with Multi-Start (MS), a Genetic Search algorithm (GA) and a Memetic Search algorithm (MA). VNS provides optimal solutions for all instances solved to optimality in a previous paper of the first two authors and outperforms MS, MA and GA on large instances.     

具有交易成本的证券投资组合选择：一种求解方法

本研究一类带交易成本证券投资组合选择的求解，在风险不超过某个阈值的假设下，我们给出一种求解方法，最后本通过实例计算表明该方法是有效的。     

人力资源成本预算与控制的理论分析

本的分析是人力资源成本管理体系研究的一部分，着重于探讨在人力资源成本管理体系中，人力资源成本的预算与控制与该体系中其他几部分之间的关系，研究人力资源成本管理实践中成本预算与控制的理论基础，并提出一些新的思路。