Testing feasibility in a lot scheduling problem

Testing feasibility in a lot scheduling problem

0.00 Avg rating0 Votes
Article ID: iaor1992248
Country: United States
Volume: 38
Issue: 6
Start Page Number: 1079
End Page Number: 1088
Publication Date: Nov 1990
Journal: Operations Research
Authors:
Keywords: scheduling
Abstract:

This paper considers 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. It investigates 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.

Reviews

Required fields are marked *. Your email address will not be published.