최적 설비 할당을 위한 정수계획 모형
Integer Programming Models for Optimal Resource Allocation
0
조회
0
다운로드
0
인용
0
참고문헌
키워드
초록
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.
Abstract
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.
참고문헌 (9)
- B. Fleischmann, "Supply Chain management and Advanced Planning: Concepts, Models, Software and Case Studies", pp.71~96 (2002), Springer-Verlag
- Wu, S. D., , The Engineering Economist, 50, pp.125~158 (2005)
- Geng, N., , International Journal of Production Research, 47, pp.3639~3655 (2009)
- Bermon, S., , Interfaces, 29(5), pp.31~51 (1999)
- Catay, B., , Computers and Operations Research, 30(9), pp.1349~1366 (2003)
- Swaminathan, J. M., , European Journal of Operational Research, 120(3), pp.545~558 (2000)
- "Barahona, F.", IBM, T.J. Watson Research Center, ~, pp.Tech. Report RC22196 (2003)
- Zhang, F., , IIE Transactions, 36(1), pp.23~37 (2004)
- Nemhauser, G.L., "Integer and Combinatorial Optimization" (1988), John Wiley & Sons