ms·2003년 8월 1일
The Capacitated Lot-Sizing Problem with Linked Lot Sizes
Christopher Suerie, Hartmut Stadtler
Management Science
156
피인용
8.4
FWCI
1
IS/마케팅/OM 탑저널 피인용
27
IS/마케팅/OM 탑저널 참고문헌
- 주제생산 계획과 일정 · 생산·최적화
01Abstract
In this paper a new mixed integer programming (MIP) model formulation and its incorporation into a time-oriented decomposition heuristic for the capacitated lot-sizing problem with linked lot sizes (CLSPL) is proposed. The solution approach is based on an extended model formulation and valid inequalities to yield a tight formulation. Extensive computational tests prove the capability of this approach and show a superior solution quality with respect to other solution algorithms published so far.
02연구 흐름
불러오는 중…
03비슷한 논문
불러오는 중…
04이후 연구
불러오는 중…
05선행 연구
불러오는 중…
06서지 정보
- 저널Management Science · 49(8) · 1039–1054
- 토픽Supply Chain and Inventory Management · Management Information Systems
- DOI10.1287/mnsc.49.8.1039.16406
- 저자Christopher Suerie, Hartmut Stadtler