TESTING FEASIBILITY IN A LOT SCHEDULING PROBLEM

• 成果类型: Article
• 署名作者: ANDERSON, EJ
• 刊物名称: OPERATIONS RESEARCH
• ISSN/ISSBN: 0030-364X
• DOI: 10.1287/opre.38.6.1079
• 发表日期: 1990
• 页码: 1079-1088
• 关键词: analysis of algorithms; computational complexity; NP-HARDNESS OF A LOT SCHEDULING PROBLEM; production scheduling; Heuristic; ECONOMIC LOT SCHEDULING PROBLEM

摘要

In this paper, we consider a version of the Economic Lot Scheduling Problem in which there are no costs specified. The usual form of this problem seeks a pattern of production that minimizes the sum of holding the setup costs. We investigate the problem of finding a feasible schedule which avoids a stockout given the initial stocks of the products being manufactured. It is shown that this problem is NP-hard, and an effective heuristic method for its solution is proposed. This heuristic method is compared with a more naive approach to the problem and some computational results are given.