Analyzing the effect of the inventory policy on order and inventory variability with linear control theory

In this paper we apply linear control theory to study the effect of various inventory policies on order and inventory variability, which are key drivers of supply chain performance. In particular, we study a two-echelon supply chain with a stationary demand pattern under the influence of three inventory policies: an inventory-on-hand policy that bases orders on the visible inventory at an installation, an installation-stock policy that bases orders on the inventory position (on-hand plus on-order inventory) at an installation, and an echelon-stock policy that bases orders on the inventory position at that installation and all downstream installations. We prove analytically that the inventory-on-hand policy is unstable in practical settings, confirming analytically what has been observed in experimental settings and in practice. We also prove that the installation-stock and echelon-stock policies are stable and analyze their effect on order and inventory fluctuation. Specifically, we show the general superiority of the echelon-stock in our setting and demonstrate analytically the effect of forecasting parameters on order and inventory fluctuations, confirming the results in other research.     

Optimisation of fault-tolerant fabric-cutting schedules using genetic algorithms and fuzzy set theory

In apparel industry, manufacturers developed standard allowed minutes (SAMs) databases on various manufacturing operations in order to facilitate better scheduling, while effective production schedules ensure smoothness of downstream operations. As apparel manufacturing environment is fuzzy and dynamic, rigid production schedules based on SAMs become futile in the presence of any uncertainty. In this paper, a fuzzification scheme is proposed to fuzzify the static standard time so as to incorporate some uncertainties, in terms of both job-specific and human related factors, into the fabric-cutting scheduling problem. A genetic optimisation procedure is also proposed to search for fault-tolerant schedules using genetic algorithms, such that makespan and scheduling uncertainties are minimised. Two sets of real production data were collected to validate the proposed method. Experimental results indicate that the genetically optimised fault-tolerant schedules not only improve the operation performance but also minimise the scheduling risks.     

技术不确定环境下新产品策略的设计应用

技术的动态发展和企业间的竞争对企业新产品策略有很大影响,直接决定新产品的引进周期。本文在产业技术动态变化的随机环境下构建随机动态规划模型,关注产业技术进步、投资成本和产品市场竞争等影响因素,探讨企业进行新产品引进的周期选择,对新产品引进的周期和质量决策进行方法设计和应用举例。利用随机动态规划模型得出新产品引进的最优时间周期,用算例分析技术进步和产品研发成本对企业引进周期策略的影响,采取策略迭代的方法进行求解,发现技术进步较快时企业的新产品引进步伐也较快,研发成本的提高使企业的新产品引入步伐降低。     

A web-based workforce management system for Sainsburys Supermarkets Ltd

Labour scheduling plays an important and critical role in Sainsburys day to day operations and profitability. The integrated workforce management solution for Sainsburys is an intelligent solution for the operational deployment of human resources, integrated business forecasting, generation and calculation of workload and staff scheduling. The workforce management technology has provided Sainsburys with a fully web-based and centralised system that produces optimised schedules for all employees satisfying the forecasted demand of work with granularity of fifteen minutes. The system is configured to respect all operational and business requirements as well as employee contractual constraints. This paper introduces the workforce management solution system designed, developed and implemented for Sainsburys. We concentrate on two modelling structures, namely the work pattern model and optimisation model, and briefly discuss the optimisation process.     

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.     

Approximation algorithms for scheduling problems with a modified total weighted tardiness objective

We study the approximability of minimum total weighted tardiness with a modified objective which includes an additive constant. This ensures the existence of a positive lower bound for the minimum value. Moreover the new objective has a natural interpretation in just-in-time production systems.     

原木随机存贮策略的最优化问题

本主要介绍原木经销商在周期内原木变价销售情况下的最佳期初贮存量的决策方法，在建立期望机会成本的数学模型基础上，探讨原木随机存贮策略的最优化问题。     

Computing Aviation Sparing Policies: Solving a Large Nonlinear Integer Program

Deployed US Navy aircraft carriers must stock a large number of spare parts to support the various types of aircraft embarked on the ship. The sparing policy determines the spares that will be stocked on the ship to keep the embarked aircraft ready to fly. Given a fleet of ten or more aircraft carriers and a cost of approximately 50 million dollars per carrier plus the cost of spares maintained in warehouses in the United States, the sparing problem constitutes a significant portion of the Navy’s resources. The objective of this work is to find a minimum-cost sparing policy that meets the readiness requirements of the embarked aircraft. This is a very large, nonlinear, integer optimization problem. The cost function is piecewise linear and convex while the constraint mapping is highly nonlinear. The distinguishing characteristics of this problem from an optimization viewpoint are that a large number of decision variables are required to be integer and that the nonlinear constraint functions are essentially “black box” functions; that is, they are very difficult (and expensive) to evaluate and their derivatives are not available. Moreover, they are not convex. Integer programming problems with a large number of variables are difficult to solve in general and most successful approaches to solving nonlinear integer problems have involved linear approximation and relaxation techniques that, because of the complexity of the constraint functions, are inappropriate for attacking this problem. We instead employ a pattern search method to each iteration of an interior point-type algorithm to solve the relaxed version of the problem. From the solution found by the pattern search on each interior point iteration, we begin another pattern search on the integer lattice to find a good integer solution. The best integer solution found across all interations is returned as the optimal solution. The pattern searches are distributed across a local area network of non-dedicated, heterogeneous computers in an office environment, thus, drastically reducing the time required to find the solution.     

保险管理决策中的两个问题

本文运用风险决策理论建立了分保限额与红利分派两个保险管理决策问题的数学模型,从理论和实践两个方面讨论了最优管理策略,并给出了计算实例。     

Redefining Event Variables for Efficient Modeling of Continuous-Time Batch Processing

We define events so as to reduce the number of events and decision variables needed for modeling batch-scheduling problems such as described in [15]. We propose a new MILP formulation based on this concept, defining non-uniform time periods as needed and decision variables that are not time-indexed. It can handle complicated multi-product/multi-stage machine processes, with production lines merging and diverging, and with minimum and maximum batch sizes. We compare it with earlier models and show that it can solve problems with small to medium demands relative to batch sizes in reasonable computer times.