中文摘要：

针对经济批量排产问题假定生产可以在库存降为0之前开始,并且提出新的算法求产品的生产顺序。结果表明,该排产方法成本要低于其他2种常用的经济批量排产问题的方法,并且给出了算法的时间复杂性。

英文摘要：

It is frequent occurrence in chemical, paper, pharmaceutical, steel industries that multiple products will be produced on a single facility or assembly line. Thus, schedule is necissary to minimize cost and satisfy demand. This kind of problem often referred to as economic lot scheduling problem （ELSP）. Being different from the past studies, the situation where the production of a product may be started before the inventory level drops to zero is considered. Besides, a new algorithm is proposed to produce production sequence. A Benchmark numerical example shows the approach can obtain lower cost than that obtained by using basic period approach or common cycle approach. The algorithm for time complexity is also given.