Production/distribution system design with inventory considerations

This study addresses the design of a three‐stage production/distribution system where the first stage includes the set of established retailers and the second and third stages include the sets of potential distribution centers (DCs) and potential capacitated suppliers, respectively. In this problem, in addition to the fixed location/operating costs associated with locating DCs and suppliers, we consider the coordinated inventory replenishment decisions at the located DCs and retailers along with the appropriate inventory costs explicitly. In particular, we account for the replenishment and holding costs at the retailers and selected DCs, and the fixed plus distance‐based transportation costs between the selected plants and their assigned DCs, and between the selected DCs and their respective retailers, explicitly. The resulting formulation is a challenging mixed‐integer nonlinear programming model for which we propose efficient heuristic solution approaches. Our computational results demonstrate the performance of the heuristic approaches as well as the value of integrated decision‐making by verifying that significant cost savings are realizable when the inventory decisions and costs are incorporated in the production distribution system design. © 2012 Wiley Periodicals, Inc. Naval Research Logistics 59: 172–195, 2012     

装备再制造升级及其工程技术体系

装备再制造是实现装备性能恢复的重要手段,对老旧装备进行再制造升级,可以快速将老旧装备性能提升到新的水平,满足基于信息系统的体系作战能力要求。明确了装备再制造升级的概念及作用,分析了国内外装备再制造升级的发展应用,构建了装备再制造升级的工艺与技术体系,提出了我军装备再制造升级的几点思考。     

虚拟再制造研究的体系框架

再制造工程是人类社会可持续发展战略的重要保证,虚拟再制造是提高再制造工程效益的重要内容。为了进一步开展广泛而深入地研究,首先需要明确其主要基础理论及重要研究内容。现根据虚拟再制造的显著特点,参考虚拟制造的研究内容,探讨建立了虚拟再制造研究的体系框架。     

Capacitated selection problem

Optimizing the selection of resources to accomplish a set of tasks involves evaluating the tradeoffs between the cost of maintaining the resources necessary to accomplish the tasks and the penalty cost associated with unfinished tasks. We consider the case where resources are categorized into types, and limits (capacity) are imposed on the number of each type that can be selected. The objective is to minimize the sum of penalty costs and resource costs. This problem has several practical applications including production planning, new product design, menu selection and inventory management. We develop a branch‐and‐bound algorithm to find exact solutions to the problem. To generate bounds, we utilize a dual ascent procedure which exploits the special structure of the problem. Information from the dual and recovered primal solutions are used to select branching variables. We generate strong valid inequalities and use them to fix other variables at each branching step. Results of tests performed on reasonably sized problems are presented. © 1999 John Wiley & Sons, Inc. Naval Research Logistics 46: 19–37, 1999     

The selection allocation problem

The Selection Allocation Problem (SAP) is a single period decision problem which involves selecting profit‐maximizing (or cost‐minimizing) activities from various distinct groups, and determining the volume of those activities. The activities in each group are selected subject to the availability of that group's resource, which is provided by either pooling or blending raw inputs from several potential sources. Imbedded in the decision process is the additional task of determining how much raw input is to be allocated to each group to form the resource for that group. Instances of this problem can be found in many different areas, such as in tool selection for flexible manufacturing systems, facility location, and funding for social services. Our goal in this paper is to identify and exploit special structures in the (SAP) and use those structures to develop an efficient solution procedure. © 1999 John Wiley & Sons, Inc. Naval Research Logistics 46: 707–725, 1999     

装备再制造性工程及其发展建议

装备再制造性工程是再制造工程的重要内容和分支,其主要研究如何在装备设计及使用中能够保证装备末端实现资源的最大化再制造。装备再制造性工程的内容涵盖了装备全寿命周期的各个阶段,较全面地分析了再制造性工程的内涵,初步构建了装备再制造性工程的内容框架,提出了再制造性工程的发展建议,为装备再制造性工程的研究和发展提供了参考。     

Exact algorithms for integrated facility location and production planning problems

We consider a class of facility location problems with a time dimension, which requires assigning every customer to a supply facility in each of a finite number of periods. Each facility must meet all assigned customer demand in every period at a minimum cost via its production and inventory decisions. We provide exact branch‐and‐price algorithms for this class of problems and several important variants. The corresponding pricing problem takes the form of an interesting class of production planning and order selection problems. This problem class requires selecting a set of orders that maximizes profit, defined as the revenue from selected orders minus production‐planning‐related costs incurred in fulfilling the selected orders. We provide polynomial‐time dynamic programming algorithms for this class of pricing problems, as well as for generalizations thereof. Computational testing indicates the advantage of our branch‐and‐price algorithm over various approaches that use commercial software packages. These tests also highlight the significant cost savings possible from integrating location with production and inventory decisions and demonstrate that the problem is rather insensitive to forecast errors associated with the demand streams. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011     

再制造研究应用现状及发展策略

以国家“发展循环经济、建设节约型社会”的重大战略为背景,介绍了再制造的内涵和国内外装备再制造研究、应用现状以及策略方法。在此基础上,结合我国现状和特点,分析了我国推动再制造产业发展的需求和潜力,并初步提出我国发展再制造工程存在的问题和应采取的有效措施。     

A metaheuristic scheduling procedure for resource-constrained projects with cash flows

Resource-constrained project scheduling problems with cash flows (RCPSPCF) are complex, combinatorial optimization problems. Many heuristics have been reported in the literature that produce reasonable schedules in limited project environments. However, the lack of a heuristic that dominates under differing project conditions can lead to a suboptimal choice of an appropriate heuristic for scheduling any given project. This may result in poor schedules and monetary losses. This paper reports on the application of the tabu search metaheuristic procedure for the RCPSPCF. Strategies for neighborhood generation and candidate selection that exploit the special features of the problem are combined with a simple multiheuristic start procedure. Extensive experimentation, with multiple data sets and comparison with an upper bound, indicates a significant improvement, both in project Net Present Value (NPV) as well as the number of projects, where the metaheuristic outperforms the best known heuristics in the literature. More specifically, this procedure produces the best schedules in over 85% of the projects tested, in contrast to the best single-pass heuristics which have been shown to dominate in at most 20% of the same cases. This iterative, general purpose heuristic is able to adapt significantly better to the complex interactions of the many critical parameters of the RCPSPCF than single-pass heuristics that use more specific information about each project environment. © 1999 John Wiley & Sons, Inc. Naval Research Logistics 46: 912–927, 1999     

发展装备再制造，提升军用装备保障力和战斗力

装备再制造是指废旧装备高技术修复、改造的产业化。大力发展装备再制造,可促进高技术在武器装备中的应用,推动武器装备维修保障方式的改变,是节省军费、提高装备性能的重要举措。装备再制造学科的建设是装甲兵工程学院学科建设新的增长点。通过加强宣传、组织试点、合力攻关、培养人才等综合措施,全力推进全军及学院装备再制造的发展。     

装备再制造费用预测估算方法

在装备再制造周期及再制造费用基本概念的基础上,给出了再制造费用参数的相关内容,并阐述了工程估算法、专家判断估算法、参数估算法、类比估算法等4种装备再制造费用分析及预测估算的方法,构建了基于工程估算法的再制造费用分解结构,并对再制造费用分析流程进行了详细描述,可为形成正确的再制造设计方案提供费用决策依据。