논문
학술저널
키워드
초록
A single-product parallel-facilities production planning problem with capacity constraints is analyzed, in which known demands have to be satisfied, and concave production and inventory costs are considered. The model concerns both the nonbacklogging and backlogging cases. The structure of an optimal solution is characterized and then used in a dynamic programming algorithm.
목차
ABSTRACT
1. INTRODUCTION
2. MATHEMATICAL DESCRIPTION
3. CHARACTERIZATION OF EXTREME POINTS
4. A SOLUTION ALGORITHM
5. CONCLUSION
REFERENCES
참고문헌 (0)
등록된 참고문헌 정보가 없습니다.
해당 권호 수록 논문 (0)
등록된 수록 논문 정보가 없습니다.