考虑货架存放期的经济批量排产问题的改良算法

经济批量排产问题是关于在单一设备上协调地、周期性地生产多种产品的问题.其解要求在生产准备与库存总成本最小的条件下,决定 I 种产品的生产序列.本文研究的经济批量排产问题考虑了产品货架存放期因素.指出了Dobson算法的不足,并提出了求解该问题的新算法(改进的装箱算法),新算法不仅以生产次数最大的产品为基础进行装箱,而且进一步以生产次数略低的产品为基础进行装箱.排产时,先按生产次数降序进行装箱,再按单次生产时间与生产准备时间之和降序装箱.计算结果显示,本算法结果更优.     

经济批量排产问题的改进算法:设定最高允许高度

经济批量排产问题是指在生产准备费用与库存费用最低的情况下,协调地、周期性地生产多种产品的问题.由于此问题是NP-hard的,人们一种致力于寻找快速地求解高质量的近似最优解的方法.在将生产次数舍入为2的幂次后,误差小,获得可行解的速度快.研究的经济批量排产问题考虑了产品货架存放期因素.指出了Dobson算法的不足,并提出了基于2的幂次条件的改进算法.改进算法设定了最高允许高度,首先给部分箱进行装箱.由于能获得高质量的生产排产,因此,算法能获得2的幂次条件下的高质量解.给出一个算例,计算结果显示,算法结果更优.     

经济批量问题的数学模型与算法新进展

经济批量问题一般是讨论稳定的外部需求和有限的生产能力条件下实际生产过程的优化计划排产，具有重要应用价值。本文在综合大量国内外有关文献的基础上，对经济批量问题的数学模型和算法新进展作了比较系统，全面的介绍。     

库存能力有限的再制造批量决策

从能力有限的动态批量问题出现开始，国内外众多学者全心致力于这类问题的研究。随着环境问题在制造业企业生产过程中的日益突出，资源回收与再制造成为了许多企业关注的热点。为了充分考虑实际生产的需要，本文在Richter再制造模型的基础上，引入库存能力约束，利用动态规划方法给出一个多项式算法来求解终产品库存能力受限问题和退回产品库存能力受限问题，并分别用一个模拟算例验证了算法的可行性。     

原材料经济订购及产品定价策略

生产企业产品的需求量受销售价格的影响 ,而产品需求量的大小必将影响原材料的经济批量 .本文研究生产企业为获取最大利润如何确定原材料的经济批量及产品销售价格 .文中主要就单产品生产问题进行讨论 ,并指出多产品生产时可分解为多个单产品生产问题 .作为一个特例 ,本文结论也适用于商业企业     

能力受限的批量问题的数学模型与算法新进展

古典库存问题和能力无限的单层批量问题的研究已经有几十年的历史了，但由于实际生产中产品结构往往比较复杂、生产能力总有限的，因此能力受限的批量问题（尤其是多层批量问题）成为了近年来运筹学、管理科学和工业工程等领域的研究热点之一。本文在综合大量国内外有关文献的基础上，对一般批量问题的数学模型作了比较系统，全面的介绍，重点讨论能力受限的单层批量问题和多层批量问题的一些新算法，并指出一些值得深入研究和努力实     

考虑机器调整次数和产品质量的卷烟批量计划和柔性流水车间调度集成问题

针对卷烟企业生产中的批量计划和柔性流水车间调度集成问题,构建了整数规划模型,目标函数由卷烟生产时间、生产线调整次数、卷烟质量、库存成本四部分组成。鉴于该问题的NP-hard性,设计遗传算法进行求解,通过合理设计遗传算子,避免不可行解出现。应用某卷烟企业数据得到优化排产结果,与该企业之前依照经验排产方案进行对比,发现优化排程结果在减少品牌转换次数,提高生产的连续性方面具有明显优势。该算法已作为某卷烟企业排产人员的排产参考,应用于排产决策中,取得了良好的效果,对卷烟企业制定排产计划具有一定的实际指导意义。     

多产品单层能力受限批量问题的前向启发式算法的可行性过程

本文讨论多产品、单层、能力受限批量问题的前向启发式算法，指出了这类算法中现有算法的一些不足之处。为了克服这些不足，我们给出了可行解存在的充分必要条件，并在此基础上提出一个可行化算法。     

存货采购批量的灵敏度分析

本文由经济批量基本模型的灵敏度分析，探讨了模型参数对批量及存货成本的动态影响，为企业合理调查采购批量，节约流动资金占用提供了一条有效途径     

基于多种运输渠道的经济批量问题的多项式时间算法

为了集中管理, 降低成本, 增强竞争优势, 供应商通常只负责生产,而把产品的配送业务外包给某个配送中心, 由配送中心按照零售商的需求决定发货运输的方式和时间.这样供应商, 配送中心和零售商就构成了二级供应链系统.本文研究的是运输方式为不同参数的全单位数量折扣结构时, 二级供应链系统的经济批量问题.分析了最优解的性质,并对此问题的一种特殊情形给出一个多项式时间算法.     

A profit-maximizing economic lot scheduling problem with price optimization

The economic lot scheduling problem (ELSP) is a well known problem that focuses on scheduling the production of multiple items on a single machine such that inventory and setup costs are minimized. In this paper, we extend the ELSP to include price optimization with the objective to maximize profits. A solution approach based on column generation is provided and shown to produce very close to optimal results with short solution times on a set of test problems. The results are discussed and recommendations for further research are provided.     

多种变质性物品的经济批量问题

本文考虑了多种变质性物品在同一台设备上生产的最优基本生产周期问题。本文采用了基本周期法,给出了问题的数学模型,分析了模型最优解的存在性,并给出了求解该模型的算法和算例,从算例的结果说明基本周期法比公共周期法解决经济批量问题更优。     

Economic lot scheduling problem with imperfect production processes

In this paper, we model the effects of imperfect production processes on the economic lot scheduling problem (ELSP). It is assumed that the production facility starts in the in-control state producing items of high or perfect quality. However the facility may deteriorate with time and shifts at a random time to an out of control state and begins to produce nonconforming items. A mathematical model is developed for ELSP taking into account the effect of imperfect quality and process restoration. Numerical examples are presented to illustrate important issues related to the developed model.     

A search heuristic for the sequence-dependent economic lot scheduling problem

Almost all of the research on the economic lot scheduling problem (ELSP) has assumed that setup times are sequence-independent even though sequence-dependent problems are common in practice. Furthermore, most of the solution approaches that have been developed solve for a single optimal schedule when in practice it is more important to provide managers with a range of schedules of different length and complexity. In this paper, we develop a heuristic procedure to solve the ELSP problem with sequence-dependent setups. The heuristic provides a range of solutions from which a manager can choose, which should prove useful in an actual stochastic production environment. We show that our heuristic can outperform Dobson's heuristic when the utilization is high and the sequence-dependent setup times and costs are significant.     

Determining a common production cycle time for an economic lot scheduling problem with deteriorating items

This paper considers the economic lot scheduling problem (ELSP) for a production-inventory system where items produced are subject to continuous deterioration. The problem is to schedule multiple products to be manufactured on a single machine repetitively over an infinite planning horizon. Each product is assumed to have a significant rate of deterioration. Only one product can be manufactured at a time. The demand rate for each product is constant, but an exponential distribution is used to represent the distribution of the time to deterioration. A common cycle time policy is assumed in the production process. A near optimal production cycle time is derived under conditions of continuous review, deterministic demand, and no shortage.     

Economic lot scheduling with uncontrolled co-production

The aim of this paper is to analyze the effects of uncontrolled co-production on the production planning and lot scheduling of multiple products. Co-production occurs when a proportion of a certain production comes out as another product. This is typical in the process industry where quality and process specifications can lead to diversified products. We assume that there is no demand substitution and each product has its own market. Furthermore, we assume that co-production cannot be controlled due to technical and/or cost considerations. We introduce two models that extend the common cycle economic lot scheduling (ELSP) setting to include uncontrolled co-production. In the first model we do not allow for shortages and derive the optimal cycle time expression. In the second model, we allow for planned backorders and characterize the optimal solution in closed form. We provide a numerical study to gain insight about co-production. It seems that the cycle time increases with co-production rate and utilization of the system. The effect of co-production on long-term average cost does not exhibit a certain characteristic.     

A tabu search algorithm for solving economic lot scheduling problem

The economic lot scheduling problem has driven considerable amount of research. The problem is NP-hard and recent research is focused on finding heuristic solutions rather than searching for optimal solutions. This paper introduces a heuristic method using a tabu search algorithm to solve the economic lot scheduling problem. Diversification and intensification schemes are employed to improve the efficiency of the proposed Tabu search algorithm. Experimental design is conducted to determine the best operating parameters for the Tabu search. Results show that the tabu search algorithm proposed in this paper outperforms two well known benchmark algorithms.     

An extension of the extended basic period approach for economic lot scheduling problems

This paper addresses the problem of choosing cyclical production patterns for several products which are produced on a common production facility. The extended basic period approach of Elmaghraby is extended by allowing more than two basic periods. The problem of dimensionality of the dynamic programming formulation is dealt with by aggregating the capacity data in different basic periods.The author is indebted to Dr. S. E. Elmaghraby for inspiring him to work on the economic lot scheduling problem and for many valuable suggestions. The author is also grateful to Mr. Z. Naman for carrying out the computer programming.