Modelling recruitment training in mathematical human resource planning

This paper deals with mathematical human resource planning; more specifically, it suggests a new model for a manpower‐planning system. In general, we study a k‐classed hierarchical system where the workforce demand at each time period is satisfied through internal mobility and recruitment. The motivation for this work is based on various European Union incentives, which promote regional or local government assistance programs that could be exploited by firms not only for hiring and training newcomers, but also to improve the skills and knowledge of their existing personnel. In this respect, in our augmented mobility model we establish a new ‘training/standby’ class, which serves as a manpower inventory position for potential recruits. This class, which may very well be internal or external to the system, is incorporated into the framework of a non‐homogeneous Markov chain model. Furthermore, cost objectives are employed using the goal‐programming approach, under different operating assumptions, in order to minimize the operational cost in the presence of system's constraints and regulations. Copyright © 2002 John Wiley & Sons, Ltd.     

Optimal Path Planning Based on Visibility

Various problems associated with optimal path planning for mobile observers such as mobile robots equipped with cameras to obtain maximum visual coverage of a surface in the three-dimensional Euclidean space are considered. The existence of solutions to these problems is discussed first. Then, optimality conditions are derived by considering local path perturbations. Numerical algorithms for solving the corresponding approximate problems are proposed. Detailed solutions to the optimal path planning problems for a few examples are given.     

Characteristics and structures of weak efficient surfaces of production possibility sets

This paper studies the characteristics and structure of the weak surface of the production possibility set. We apply techniques and methods of transferring a polyhedral cone from its intersection form to its sum form, identify an intersection representation of the production possibility set. We give the structure theorem of weak surface of the production possibility set, which includes three complementary slackness conditions. We define the input weak efficiency and output weak efficiency for different DEA models according to the representation of the intersection form. It investigates the characteristics of the weak surfaces, and proves the structure theorems of input weak DEA efficiency and output weak DEA efficiency. The structure theorems establish weighted combination of inputs and outputs that are weak DEA efficient. Numerical examples are provided for illustration.     

A graph theory approach to subcontracting, machine duplication and intercell moves in cellular manufacturing

We address in this paper the problem of finding an optimal strategy for dealing with bottleneck machines and bottleneck parts in the cell formation process in group technology. Three types of economic decisions are considered: subcontracting, machine duplication and intercell moves. The problem is formulated as a minimum weighted node covering problem in a hypergraph, and we show that it can be solved in polynomial time by finding a maximum weighted stable set in a bipartite graph. We extend this result to cellular manufacturing systems in which the sequence of operations of each part is known in advance.     

人力资源的预测方法

人力资源规划是必不可少的管理环节．科学的人力资源规划，必须建立在对人员供、需的准确预测的基础上．本文讨论人力资源预测的问题和转移矩阵等方法的使用．     

Problems, Models and Complexity. Part II: Application to the DLSP

In Part I of this study, we suggest to identify an operations research (OR) problem with the equivalence class of models describing the problem and enhance the standard computer-science theory of computational complexity to be applicable to this situation of an often model-based OR context. The Discrete Lot-sizing and Scheduling Problem (DLSP) is analysed here in detail to demonstrate the difficulties which can arise if these aspects are neglected and to illustrate the new theoretical concept. In addition, a new minimal model is introduced for the DLSP which makes this problem eventually amenable to a rigorous analysis of its computational complexity.     

Capacity augmentation of a supply chain for a short lifecycle product: A system dynamics framework

For an innovative product characterized by short product lifecycle and high demand uncertainty, investment in capacity buildup has to be done cautiously. Otherwise either the product’s market diffusion is impeded or the manufacturer is left with unutilized capacity. Using the right information for making capacity augmentation decisions is critical in facing this challenge. In this paper, we propose a method for identifying critical information flows using the system dynamics model of a two-echelon supply chain. The fundamental premise of system dynamics methodology is that (system) structure determines (its) behavior. Using loop dominance analysis method we study the feedback loop structure of the supply chain system. The outcome is a set of dominant loops that determine the dynamics of capacity growth. It is revealed that the delivery delay information has little effect while the loop that connects retail sales with production order affects the dynamics significantly. Modifying this loop yields appropriate capacity augmentation decisions resulting in higher performance. What-if analyses bring out effects of modifying other structural elements. In conclusion, we claim that the information feedback based methodology is general enough to be useful in designing decision support systems for capacity augmentation. The limitations of the model are also discussed and possible extensions identified.     

Optimal production and rationing decisions in supply chains with information sharing

This paper considers a two-echelon capacitated supply chain with two non-identical retailers and information sharing. We characterize the optimal inventory policies. We also study the benefits of the optimal stock rationing policy over the first come first served (FCFS) and the modified echelon-stock rationing (MESR) policies.     

重离子治疗计划系统的构想

对重离子柬治癌的优势进行简要的回顾，并着重介绍了用于重离子放射治疗的治疗计划系统。治疗计划系统是一套软件系统，不同的硬件设施应有与其相匹配的软件系统，即治疗计划系统。在此基础上，针对兰州重离子加速器的特点提出一些关于治疗计划系统方面的构想。After a brief review concerning the advantages of heavy ions in radiotherapy, more interests are concentrated on treatment planning system （TPS） for heavy ion radiotherapy. Compared to the hardware devices such as accelerator and beam delivery system, the TPS is a set of software system, and different therapy facilities require their corresponding TPSs. Based on the specialities of the Heavy Ion Research Facility in Lanzhou （HIIRFL）, some suggestions on the TPS for tumor therapy at HIRFL finally are given.     

Pushing Squares Around

We study dynamic self-reconfiguration of modular metamorphic systems. We guarantee the feasibility of motion planning in a rectangular model consisting of square modules that are allowed to slide along or rotate about one another. That is, we show that any two connected configurations of the same number of modules can be transformed into each other by a sequence of moves so that all intermediate configurations are connected. This settles a conjecture formulated in [6].