1. Remarks on: `Some Extensions of the Discrete Lotsizing and Scheduling Problem.'.
- Author
-
Webster, Scott
- Subjects
COMPUTATIONAL complexity ,PRODUCTION scheduling ,ECONOMIC lot size ,ALGORITHMS ,ECONOMETRIC models ,MATHEMATICAL models ,PRODUCT management ,OPERATIONS research ,MATHEMATICAL models in business ,MATHEMATICAL models of industrial management ,BUSINESS mathematics ,MANAGEMENT science - Abstract
The article discusses complexity analysis as it pertains to lotsizing and scheduling problems. The author believes this topic is important for three reasons. First, research in the field of lotsizing and scheduling is rapidly growing. Second, problems in lotsizing and scheduling research require less information to represent an instance than a potential solution. Third, the existing literature is unclear. The author investigates three theorems presented in earlier literature and analyzes why they are or are not valid.
- Published
- 1999
- Full Text
- View/download PDF