MULTIECHELON ASSEMBLY SYSTEMS WITH NONSTATIONARY DEMANDS - HEURISTICS AND WORST CASE PERFORMANCE BOUNDS

• 成果类型: Note
• 署名作者: JONEJA, D
• 刊物名称: OPERATIONS RESEARCH
• ISSN/ISSBN: 0030-364X
• DOI: 10.1287/opre.39.3.512
• 发表日期: 1991
• 页码: 512-518
• 关键词: INVENTORY PRODUCTION; MULTIECHELON ASSEMBLY SYSTEMS; production scheduling; HEURISTICS WITH ERROR BOUNDS

摘要

In a multi-echelon assembly system, each production stage has inputs from a number of preceding stages, and supplies at most one succeeding stage. The product of the final stage is used to satisfy external demand in discrete time. There are fixed setup costs and linear inventory holding costs at each stage. The objective is to minimize the cost of operating the system over a finite time horizon. We consider the common case of nonstationary demands, and propose an extremely fast and simple single-pass approximation algorithm for this problem. We prove that in the worst case the performance of the algorithm is uniformly bounded.