An efficient optimal algorithm for the quantity discount problem in material requirement planning

An optimal algorithm based on branch-and-bound approach is presented in this paper to determine lot sizes for a single item in material requirement planning environments with deterministic time-phased demand and constant ordering cost with zero lead time, where all-units discounts are available from vendors and backlog is not permitted. On the basis of the proven properties of optimal order policy, a tree-search procedure is presented to construct the sequence of optimal orders. Some useful fathom rules have been proven, which make the algorithm very efficient. To compare the performance of this algorithm with the other existing optimal algorithms, an experimental design with various environments has been developed. Experimental results show that the performance of our optimal algorithm is much better than the performance of other existing optimal algorithms. Considering computational time as the performance measure, this algorithm is considered the best among the existing optimal algorithms for real problems with large dimensions (i.e. large number of periods and discount levels).     

Economic lot sizing in a production system with random demand

An extended economic production quantity model that copes with random demand is developed in this paper. A unique feature of the proposed study is the consideration of transient shortage during the production stage, which has not been explicitly analysed in existing literature. The considered costs include set-up cost for the batch production, inventory carrying cost during the production and depletion stages in one replenishment cycle, and shortage cost when demand cannot be satisfied from the shop floor immediately. Based on renewal reward process, a per-unit-time expected cost model is developed and analysed. Under some mild condition, it can be shown that the approximate cost function is convex. Computational experiments have demonstrated that the average reduction in total cost is significant when the proposed lot sizing policy is compared with those with deterministic demand.     

基于RS485总线和ModBus RTU通讯协议的浆纱机速度监测系统

通过建立基于RS485总线和ModBus RTU协议的浆纱机速度监测系统,来实现浆纱机生产信息的管理汇总,有效地杜绝了值车工的不当操作,保障了浆纱机的正常运行,提高了织造的生产效率。     

Optimal structural design with indirect use of Transferred Forces

An optimal design method based on the concepts of Transferred Forces is introduced. The method uses these forces in an indirect way. The concept of reaction functional based on transferred forces is introduced. The functional approximates the structural behaviour in terms of the properties of a selected region. Using the reaction functionals, a nonlinear programming formulation and a computational method that perform sizing and topology optimization are developed. The procedure does not need structural analyses during optimization iterations. Example problems are solved with the method and the similar solutions are obtained for a refined mesh model and a different starting design. Thus, it is concluded that the new concept presented here is applicable to structural optimization problems. Received June 28, 2000     

Fast Lighting Independent Background Subtraction

This paper describes a simple method of fast background subtraction based upon disparity verification that is invariant to arbitrarily rapid run-time changes in illumination. Using two or more cameras, the method requires the off-line construction of disparity fields mapping the primary background images. At runtime, segmentation is performed by checking background image to each of the additional auxiliary color intensity values at corresponding pixels. If more than two cameras are available, more robust segmentation can be achieved and, in particular, the occlusion shadows can be generally eliminated as well. Because the method only assumes fixed background geometry, the technique allows for illumination variation at runtime. Since no disparity search is performed, the algorithm is easily implemented in real-time on conventional hardware.     

Identification and sizing of the entirely visible rocks from a 3D surface data segmentation of laboratory rock piles

Once segmentation of 3D surface data of a rock pile has been performed, the next task is to determine the visibility of the surface rocks. A region boundary-following algorithm that accommodates irregularly spaced 3D coordinate data is presented for determining this visibility. We examine 3D surface segmentations of laboratory rock piles and determine which regions in the segmentation correspond to entirely visible rocks, and which correspond to overlapped or partially visible rocks. This is a significant distinction as it allows accurate size determination of entirely visible rocks, separate handling of partially visible rocks, and prevents erroneous bias resulting from mishandling partially visible rocks as smaller entirely visible rocks. Literature review indicates that other rock pile sizing techniques fail to make this distinction. The rock visibility results are quantified by comparison to manual surface classifications of the laboratory piles and the size results are quantified by comparison to the sieve size.     

异经竹／棉牛仔布的生产实践

介绍了异经竹/棉牛仔布的生产工艺,阐述了原纱基本质量指标、经纱染色的工艺条件,指出了经纱配置和浆纱织造的工艺原则。     

横移计量法在经编织物设计及分析中的应用

如何快速有效地设计、分析出正确的垫纱运动图,提高经编产品设计、分析效率,是从业人员面临的一个难点.运用横移计量法解决该难点是一种有效的途径.     

计算机辅助管材排料算法及其实现

针对多数企业在机械加工中都是采用人工排料的现状，提出了基于线性规划的计算机辅助排料算法，并建立了管材下料的数学模型，给出了求解所有合理下料方案的高效算法，以及求解该数学模型适合生产实际的快速算法，根据此算法下料能得到最优的结果，即能最大限度地提高原料利用率，有效降低企业生产成本。     

Solving mixed integer programming production planning problems with setups by shadow price information

Algorithms developed to solve linear programming (LP) problems and advances in computer speed have made large-scale LP problems solvable in time for implementation. Solving an LP is relatively easier than solving an MIP for modern production planning problems. In this study, we propose a heuristic iterative algorithm between LP solution phases and setup decision computations for solving these difficult MIP production planning problems. By utilizing the shadow price information provided by the LP solution of the previous iteration, the setup decision computation converts an MIP problem into an LP problem, which can be efficiently solved in the current iteration. Extensive experiments show that the proposed heuristic algorithm performs well.