최적 설비 할당을 위한 정수계획 모형
- Issued Date
- Operational capacity planning Resource Allocation Due date Integer Programming Optimal Algorithm
- This article considers an operational capacity planning problem that occurs in a High-tech electronic manufacturing company. In the problem, we do not consider any capacity expansion but determine the allocation configuration between items and parallel facilities. A challenge of the problem is to control inventory holding days. The objective function of the problem is to minimize the total cost of inventory, production and resource allocation costs. We propose two integer programming models for the problem and test them with real world problem instances.
- Authorize & License
- Files in This Item:
Items in Repository are protected by copyright, with all rights reserved, unless otherwise indicated.