한국경영과학회:학술대회논문집 (Proceedings of the Korean Operations and Management Science Society Conference)
- 한국경영과학회/대한산업공학회 2003년도 춘계공동학술대회
- /
- Pages.409-416
- /
- 2003
최대 로트 그룹핑 문제의 복잡성
On the hardness of maximum lot grouping problem
- 황학진 (조선대학교 산업공학과)
- Hwang Hark-Chin (Department of Industrial Engineering, Chosun University.)
- 발행 : 2003.05.01
초록
We consider the problem of grouping orders into lots. The problem is modelled by a graph G = (V, E). where each node
키워드