시간대별 차등 전기요금을 고려한 최소비용 장비운용계획Optimal Machine Operation Planning under Time-based Electricity Rates
- Other Titles
- Optimal Machine Operation Planning under Time-based Electricity Rates
- Authors
- 김인호; 옥창수
- Issue Date
- 2014
- Publisher
- 한국산업경영시스템학회
- Keywords
- Machine Operation Planning; Integer Programming; Time-based Electricity Rate; Theory of Constraints
- Citation
- 한국산업경영시스템학회지, v.37, no.4, pp.63 - 71
- Journal Title
- 한국산업경영시스템학회지
- Volume
- 37
- Number
- 4
- Start Page
- 63
- End Page
- 71
- URI
- https://scholarworks.bwise.kr/hongik/handle/2020.sw.hongik/16837
- ISSN
- 2005-0461
- Abstract
- As power consumption increases, more power utilities are required to satisfy the demand and consequently results in tremendouscost to build the utilities. Another issue in construction of power utilities to meet the peak demand is an inefficiency causedby surplus power during non-peak time. Therefore, most power company considers power demand management with time-basedelectricity rate policy which applies different rate over time. This paper considers an optimal machine operation problem underthe time-based electricity rates. In TOC (Theory of Constraints), the production capacities of all machines are limited to oneof the bottleneck machine to minimize the WIP (work in process). In the situation, other machines except the bottleneck areable to stop their operations without any throughput loss of the whole manufacturing line for saving power utility cost. To considerthis problem three integer programming models are introduced. The three models include (1) line shutdown, (2) block shutdown,and (3) individual machine shutdown. We demonstrate the effectiveness of the proposed IP models through diverse experiments,by comparing with a TOC-based machine operation planning considered as a current model.
- Files in This Item
- There are no files associated with this item.
- Appears in
Collections - College of Engineering > Industrial and Data Engineering > Journal Articles
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.