A hierarchical approach to solve the capacitated lot-sizing and scheduling problem with sequence-dependent setups

• 발행기관: 한국산업경영시스템학회
• 저자명: Ik-Soon Kwak In-Jae Jeong
• 간행물 정보: 『한국산업경영시스템학회 학술대회』2009년 추계학술대회 논문집, 126~130쪽, 전체 5쪽
• 주제분류: 공학 > 산업공학
• 파일형태: PDF
• 발행일자: 2009.07.30

영문 초록

This paper deals with the single machine multi-product capacitated lot sizing and scheduling problem (CLSP) with sequence-dependent setup times and setup costs. The CLSP determines production quantities and sequence to satisfy deterministic and dynamic demand given multiple periods. The objective is to minimize inventory holding costs and sequence-dependent setup costs. We consider exponentially increasing and step function of sequence-dependent setup times. In this research, we propose a hierarchical approach to solve this problem. First we solve the lot sizing problem with estimated setup times and then solve the scheduling problem given the lot sizing. Finally, a small example is presented to illustrate the proposed algorithm.

목차

1. Introduction

2. Ploblem Description

3. Solution Approach

4. Example

5. Conclusion

키워드

Capacitated lot sizing Scheduling Sequence-dependent setups