An EOQ inventory model for items with Weibull distribution deterioration,ramp type demand rate and partial backlogging

In this paper, an EOQ inventory model is presented depleted not only by demand but also by Weibull distribution deterioration, in which the demand rate is assumed that with a ramp type function of time. In the model, shortages are allowed partial backlogging and the backlogging rate is variable and is dependent on waiting time for the next replenishment. The method is illustrated by three numerical examples, and sensitivity analysis of the optimal solution with respect to parameters of the system is carried out.     

具有模糊旅行时间的VRP的一种混合遗传算法

传统确定性车辆路径问题是近几十年来运筹学领域研究的一个热点问题.但在许多实际的应用中,由于受客观世界中存在的不确定性因素以及人类观察、认识事物的模糊性的影响,车辆路径问题的某些参数可能是模糊的、不确定的.文中传统确定性车辆路径问题被扩展为具有模糊特征的模糊车辆路径问题.在对具有模糊旅行时间的车辆路径问题进行简单描述的基础上,构建了该问题的数学模型,并通过将模糊逻辑、模糊控制方法与传统车辆路径问题的遗传算法进行有效结合,提出了解决该问题的一种混合遗传算法.最后给出了该问题的一个计算实例,并通过随机模拟试验验证了该算法的有效性和优越性.     

The maximum loading and the optimum number of vehicles in a double-loop of an interbay material handling system

In this paper, the loading analysis of an automated double-loop interbay material handling system (AMHS) in a wafer fabrication was analysed, considering the effects of the vehicle numbers in the inner and outer loops. Discrete-event simulation models were developed in e-M Plant to study this AMHS system with a zone control scheme to avoid any vehicle collision. The layout of an interbay system is a combination configuration in which the hallway contains double loops and the vehicles have double capacity. The combination of the shortest distance with nearest vehicle (SD–NV) and the first-encounter-first-served (FEFS) dispatching rule was used in this study. The maximum loading of this interbay system can be determined by the simulation approach. We also found that the number of vehicles in the inner and outer loops can significantly affect the interbay performance. Furthermore, the optimum combination of the vehicle numbers in the inner and outer loops can be obtained by response surface methodology.     

The Minimum-Covering/Shortest-Path Problem*

Due to the inherent multiobjective nature of many network design and routing problems, there has been a tremendous increase in multiobjective network modeling in recent years. In this article we introduce one such model, the minimum-covering/shortest-path (MinCSP) problem, and formulate several variations of the problem. The MinCSP problem is a two-objective path problem: minimization of the total population negatively impacted by the path and minimization of the total path length. A population is considered to be negatively impacted by the path if the path comes within some predetermined distance of the population. Consequently, the MinCSP problem extends the concept of coverage from facility location modeling to network design. Additionally, several existing solution methods for the problem are briefly discussed and potential applications presented.     

Simulation-based production schedule generation

Abstract

While simulation has been used in manufacturing for many years, predominantly for facility design, it is within the last few years, that simulation languages have been developed to a point where they can be used on a day-to-day basis to generate schedules and predict their performance. This paper describes our use of different modelling techniques to develop a production schedule generation system. An example describing a system for a small- to medium-sized order producing company using SIMAN/CINEMA is included. While addressing the shortcomings of existing scheduling systems it is shown how the approach taken is a feasible way of creating a dynamic goal-driven simulation-based production scheduler. The paper does not aim to describe an ‘off the shelf’ scheduling system product, but rather to give an overview to methods, techniques and experiences which enable us rapidly to tailor a simulation-based scheduling system to the specific needs of a company.     

Model-based potential analysis of the distribution logistics: a case study

Abstract

The design of its distribution logistics has a decisive influence on a company’s logistical costs and performance. They therefore make an essential contribution to corporate success. This article describes a method for analysing the potential of distribution logistics in terms of logistical costs and performance. In contrast to previous procedures of business process re-engineering, this method maps distribution logistics holistically under variable distribution structures. The article is focused on the approach and results of a case study in a multinational manufacturer of propulsion and automation technologies for machine construction and systems engineering. The developed method is distinguished by a high degree of practicality and applicability. It will contribute to a more efficient design of distribution logistics.     

Multiechelon (R,S) Inventory Model*

Most studies in multiechelon inventory systems have concentrated on understanding the specific aspects of a system's behavior. The problem of optimal policy computation has largely been ignored. In this paper, we investigate a two-echelon inventory system experiencing stochastic demand and a pull system of inventory allocation. Both echelons use an order-up-to-level type control policy. A mathematical model is developed to determine the optimal order level at all echelons and validated through simulation. Two simple algorithms to locate the optimum solution are presented. The use of graphical tools in optimal policy calculation is also discussed.     

An Efficient Heuristic Procedure for Practical-Sized Capacitated Warehouse Design and Management*

The purpose of this paper is to refine and test a distribution system design model and evaluate its performance with respect to solution quality, model validation, and algorithm performance. The paper reports on the development of a multiproduct warehouse logistics model. The logistics model is used to predict the performance of distribution companies that typically have to deal with product costs, the cost to distribute the products from a set of warehouses to customer outlets, the level of service provided to its customers, and flexibility for each product group and market segment.     

物流配送车辆路径规划模型的知识表示研究

针对物流配送车辆路径规划的实时动态建模问题,以解决模型的目标函数和约束等符号化知识的知识表示及基于知识的求解机制为突破口,提出了以七元组M=(B,O,C,I,P,E,D)表示车辆路径规划模型的知识表示方法--BOCIPED表示法;并以沈阳昌达集团餐饮配送公司为应用背景,设计建立了相应的车辆路径规划问题的建模与求解系统,通过系统的实际应用,验证了系统中BOCIPED表示方法的可行性与有效性.本研究为车辆路径规划这一难题提供由计算机自动生成模型并求解的新方法,有利于建立高智能的物流配送实时调度系统.     

基于电商承诺送达机制的多目标低碳MDVRP优化研究

针对存在多配送站的电商物流配送问题,首先,考虑实际装载量对物流配送过程中车辆燃料消耗量的影响,建立燃料消耗量模型,并结合电商平台的承诺送达机制,构建配送延迟时间函数。随后,提出了以最小化物流成本和延迟收货时间的多目标多配送站车辆路径规划问题,建立该问题的混合整数规划模型。再次,采用基于分解的多目标遗传求解算法对问题进行求解。该算法采用矩阵编码的方式,设计了基于贪婪搜索策略的启发式初始化方法,考虑到贪婪搜索策略容易陷入局部最优的劣势,在算法迭代过程中,允许部分不可行解存在以扩大解空间的搜索范围,并进一步设计了遗传算法的交叉和变异算子。最后,以具体物流配送案例进行数值实验,实验结果表明所设计的算法对求解本文模型是有效的。     

PLANNING FOR TRUCK FLEET SIZE IN THE PRESENCE OF A COMMON-CARRIER OPTION

This paper considers a class of network optimization problems in which certain directed arcs must be covered by a set of cycles. Our study was motivated by a distribution planning problem of a commercial firm that had to make deliveries over several origin-destination pairs (directed arcs) and that could service any demand arc by using a vehicle in its own fleet or by paying a common carrier. The problem is to determine an optimal fleet size and the resulting vehicle routes while satisfying maximum route-time restrictions. We formulate the problem, describe some approximate solution strategies, and discuss important implementation issues.     

Designing Distribution Systems to Support Vendor Strategies in Supply Chain Management*

The interactions among a firm's distribution strategy, market share, and distribution costs are an important consideration in the design of supply chain networks. However, these interactions are largely ignored by existing distribution system design methodologies, which assume demand is constant regardless of the firm's distribution strategy. This paper describes a multidisciplinary framework that considers these interactions in the design of “profit maximizing” distribution networks. The framework employs two major decision support methodologies: (1) binary logit models for estimating market share considering various demand-influencing parameters such as product price and distribution service, and (2) a mixed-integer programming (MIP) model for finding optimal distribution network designs. We applied the framework to an actual design problem facing a national distributor of industrial chemical products. The test results verify the framework's large-scale capability and the potential benefit of the integrated solution methodology.     

模糊车辆路径问题的一种混合遗传算法

在对模糊车辆路径问题进行简单描述的基础上,通过引入决策者主观偏好值的概念,给出了解决该问题的基本思路,建立了具有模糊特征的车辆路径问题的模糊机会规划模型,提出了求解该问题的一种基于模糊模拟的混合遗传算法。同时,在最小化总行驶距离的目标下,通过随机模拟方法研究了决策者主观偏好值的选择对最终决策目标的影响作用,并给出了其最佳取值范围。     

动态需求下车辆路径问题的周期性优化模型及求解

针对客户点不断更新的动态需求车辆路径问题,依据滚动时域对配送中心工作时间进行划分,提出基于延迟服务的周期性客户点实时重置策略,策略中延迟服务机制能结合车辆启动延迟系数对照当前时域的时间进行检验,满足所有客户点的服务需求,保证车辆满足中心时间窗约束。设计多阶段求解的混合变邻域人工蜂群算法对各时间片内子问题进行连续迭代优化,算法中子路径动态转变的设计能较好平衡原有客户点和新客户点对路径更新和车辆实时信息匹配的要求。算例验证及对比分析表明本文策略和算法在求解动态问题时的有效性和可行性。     

Iterative Converging Algorithms for Computing Bounds on Durations of Activities in Pert and Pert-Like Models

Since its invention in 1958, Program Evaluation and Review Technique (PERT) has been widely used during the planning, design, and implementation of projects. Pert models the activities of a project as a single source-single sink directed acyclic graph where nodes represent events (end or beginning of activities) and arcs activities. The maximum amount by which an activity can be delayed without delaying the overall project is called the slack. Critical tasks have zero slack whereas all noncritical tasks have positive slacks. Pert is a valuable tool in the management of large projects since it allows to compute the slack of each activity of the project. Such information may be crucial in avoiding cost overruns that would be caused by delays to critical activities and/or excessive delays to noncritical activities. What Pert fails to provide is how one should go about distributing remaining slack on noncritical activities while taking into consideration properties of the activities as well as precedence relationships among them, so as to have reasonable upper bounds on duration of all activities, critical or noncritical. In this paper we propose several algorithms for the distribution of slack on non-critical activities. We show that if one desires to distribute the remaining slack proportionally to the initially assigned activity durations then the problem is in P, and propose an algorithm of linear time complexity. However if one desires to use distribution functions other than the initial durations of activities, then the problem of slack distribution becomes NP-complete. Finding the maximal bounds corresponding to zero-slack solution at the sink requires iterative application of exponential algorithm. For that case we introduce an approximation algorithm of linear time complexity on each iteration. The algorithm iteratively increases bounds on durations of activities and converges to the zero-slack solution on all paths from the source node to the sink node in the Pert-like graph. The algorithms described in this paper were successfully applied to solving timing bounds problems in VLSI design.     

基于改进蚁群算法的低碳车辆路径问题研究

全球气候恶化危及人类生存环境,物流运输过程中产生的大量温室气体则是祸源之一。本文考虑带有碳排放约束的车辆路径问题（VRP）,以车辆行驶里程最短和碳排放量最小为目标,构建了多目标的VRP非线性规划模型。提出了一种改进的蚁群系统算法对该模型进行求解,算法在更新路径上的蚂蚁信息素时引入了混沌扰动机制,此举能降低算法运行时陷入局部最优解的概率并有效提高算法的适应性。同时,对启发因子、状态转移概率、信息素更新等环节进行了优化设计,提高了最优路径的搜索效率。最后,数值仿真实验证明了该算法的求解表现优于同类研究常用的遗传算法和禁忌搜索算法,具有较强的全局寻优能力。在灵敏性和有效性的保证下,本研究所设计的改进蚁群算法能够较好地处理低碳车辆路径问题（LCVRP）。     

Non-significant,self-validated part identification numbers

The numbering and identification of parts within a manufacturing organization is of immense importance, for it serves as a major means of communicating information throughout the organization. The oldest, and still most prominent method of part identification is the use of meaningful, alphanumeric part numbers. With the transition to computer-assisted manufacturing systems, however, many of the weaknesses of this type of system have come to light. A newer approach to part numbering, the use of all-numeric, non-significant part numbers as a vehicle for identifying parts and accessing the required information about each, may be a major contributor to improved communications in the computer age. This paper explores both approaches to part identification, addressing the advantages and drawbacks of each. It is concluded that the use of non-significant numbering is indeed the best approach to a flexible, simple, and standardized identification system, allowing access to all pertinent part information without incorporating that information into the part number. Two case studies, one of a leading compressor manufacturer, and the other a producer of greeting cards, are presented, demonstrating the feasibility of a conversion from significant to non-significant systems and the benefits obtainable. The problem of reducing data entry errors and maintaining data integrity with non-significant part numbers is analyzed and a proposed algorithm presented. Finally, routines are demonstrated for both generating and then vetting and validating non-significant numbers.     

Computational complexity of algorithms for MRP and JIT production planning problems in enterprise resource planning systems

An enterprise resource planning system (ERP) is the information backbone of many manufacturing companies. At the core of ERP is a conventional material requirements planning (MRP) production planning system or a variation of MRP when just-in-time (JIT) principles are used in manufacturing. MRP and JIT both organize production planning into a hierarchy of long-, medium- and short-range problems. In all there are eight different problems. Some are common to MRP and JIT, others are specialized for a particular system. This paper analyses the computational requirements of these problems. This is important for ERP because it plans for large numbers of products (e.g. 50 000 products at 3M Company and 44 000 products at States Industries in Oregon) at large numbers of locations (e.g. 82 locations in 21 countries for Visteon Automotive Systems of Michigan and 19 locations at Boeing). We show that adequate algorithms exist for some problems, but better algorithms are needed for other problems if ERP is to provide useful production plans.     

有模糊时间窗的车辆调度组合干扰管理研究

研究带有模糊时间窗的车辆调度组合干扰管理模型及其混合遗传算法.采用时间窗模糊化处理方法,定义客户满意度函数,根据干扰管理思想对车辆调度中组合性干扰事件进行分析,从配送路径、配送成本和客户满意度三个方面进行干扰辨识与度量,建立基于模糊时间窗的车辆调度组合干扰管理模型;构造模型求解的混合遗传算法,将最佳客户插入规则与遗传算法结合,同时在算法中嵌入模糊优化程序以处理问题的模糊特征;进行数值实验,实验结果验证了模型与算法的有效性.     

Applying a longitudinal interpretive multi-case research method to study the employee impact of operations management systems in a micro firm setting

Abstract

While many operations management journals are now publishing interpretive studies, there is still a need for more material on how to carry out such work under the interpretive gestalt. By offering a research account of a longitudinal interpretive multi-case study, this paper seeks to contribute to the literary gap in ‘how to do it [interpretive research]’. The purpose of this paper is to document a longitudinal operations management study in three micro-firms, where the catalyst for this study is the implementation of an electronic operations management system in each case. The paper chronicles the authors’ experience in a four-year multi-case study, and as such provides insight into design, development and execution of longitudinal interpretive operations management research, and the building of a theoretical model. While blueprints are not the purpose of such reflections, they can provide insight and advice to researchers, which is the underlying goal of this paper.