다수의 유한 재생산률과 다종의 컨테이너를 고려한 동적 폐기물 회수계획 및 다종제품 재생산계획 문제

이운식(Woon-Seek Lee) 대한산업공학회 2015 대한산업공학회 추계학술대회논문집 Vol.2015 No.11

This paper considers a withdrawing and remanufacturing planning problem, in which wastes are withdrew by multiple container types and can be remanufactured at each period by any value in the set 0, , ,mP} where the rate P is the increment of a remanufacturing capacity and m is a nonnegative integer. Each container type has a type-dependent carrying capacity and the freight cost is proportional to the number of containers types used. The multiple products are remanufactured by each taking a fixed portion (0< α <1) of the input wastes to satisfy dynamic demands of each product over a discrete and finite time horizon. Also, a start-up cost is only incurred at the first period of a remanufacturing block which is consecutively remanufactured. It is assumed that the related cost (withdrawing and inventory holding costs of the wastes, and the remanufacturing and inventory holding costs of the remanufactured products) functions are concave and backlogging is not allowed. The objective of this paper is to simultaneously determine the optimal withdrawing and remanufacturing plans that minimize the total cost to satisfy dynamic demands of the multiple products. In this paper, the optimal solution properties are characterized and then, based on these properties, a dynamic programming algorithm is presented to find the optimal plan. Also, a network model is proposed to efficiently find the optimal solution to (u,v)-subproblems.

폐기물 처분과 유한 재생산률을 고려한 동적 폐기물 회수계획 및 다종제품 재생산계획 문제

이운식(Woon-Seek Lee) 한국경영과학회 2016 한국경영과학회 학술대회논문집 Vol.2016 No.4

This paper considers a withdrawing and remanufacturing planning problem, in which wastes can be withdrew at a period and also remanufactured at a period by any value in the set {0, P} where the rate P is the capacity of a remanufacturing facility. The withdrawal fee is occurred as a profit term that is proportional to the withdrawing container size(W). The inventory amounts of wastes can be disposal at the end of a period by incurring a disposal cost. The multiple products are remanufactured by each taking a fixed portion (0〈αi〈1) of the input wastes to satisfy dynamic demands of each product over a discrete and finite time horizon. Also, a start-up cost is only incurred at the first period of a remanufacturing block which is consecutively remanufactured. It is assumed that the related cost (inventory holding cost of the wastes, the remanufacturing and inventory holding costs of the remanufactured products) functions are concave and backlogging is not allowed. The objective of this paper is to simultaneously determine the optimal withdrawing and remanufacturing plans that minimize the total cost to satisfy dynamic demands of the multiple products. In this paper, the optimal solution properties are characterized and then, based on these properties, a dynamic programming algorithm is presented to find the optimal plan. Also, a network model is proposed to efficiently find the optimal solution to (u,v)- subproblems.

동적 블록수송환경을 위한 네트워크 흐름모형 기반의 트랜스포터 일정계획

이운식(Woon-Seek Lee),임원일(Won-Il Lim),구평회(Pyung-Hoi Koo) 대한산업공학회 2008 대한산업공학회 추계학술대회논문집 Vol.2008 No.11

This paper considers a transporter scheduling problem under dynamic block transportation environment in shipbuilding. In dynamic situations, there exist the addition, cancellation or change of block transportation requirements, sudden breakdowns and maintenance of transporters. The transportation of the blocks in the shipyard has some distinct characteristics. Some blocks are available to be picked up at a specific time during the planning horizon while some other blocks need to be delivered before a specific time. These requirements cause two penalty times: 1) delay times incurred when a block is picked up after a required start time, and 2) tardy times incurred when a block shipment is completed after the required delivery time. The blocks are located at different areas in the shipyard and transported by transporters. The objective of this paper is to propose a heuristic algorithm based on a network flow model which minimize the weighted sum of empty transporter travel times, delay times, and tardy times. Also, a rolling-horizon scheduling method is proposed for dynamic block transportation environment. The performance of the proposed heuristic algorithms are evaluated through a simulation experiment.

조선 블록수송을 위한 동적 트랜스포터 일정계획

이운식(Lee, Woon-Seek),임원일(Lim, Won-Il),구평회(Koo, Pyung-Hoi) 한국경영과학회 2008 한국경영과학회 학술대회논문집 Vol.2008 No.5

This paper considers a transporter scheduling problem under dynamic block transportation environment in shipbuilding. In dynamic situations, there exist the addition or cancellation of block transportation requirements, sudden breakdowns and maintenance of transporters. The transportation of the blocks in the shipyard has some distinct characteristics. Some blocks are available to be picked up at a specific time during the planning horizon while some other blocks need to be delivered before a specific time. These requirements cause two penalty times: 1) delay times incurred when a block is picked up after a required start time, and 2) tardy times incurred when a block shipment is completed after the required delivery time. The blocks are located at different areas in the shipyard and transported by transporters. The objective of this paper is to propose heuristic algorithms which minimize the weighted sum of empty transporter travel times, delay times, and tardy times. Four heuristic algorithms for transporter scheduling are proposed and their performance is evaluated.

A Dynamic Production and Transportation Model with Multiple Freight Container Types

Woon-Seek, Lee(이운식) 대한산업공학회 1998 대한산업공학회지 Vol.24 No.1

조선 블록수송을 위한 동적 트랜스포터 일정계획

이운식(Lee, Woon-Seek),임원일(Lim, Won-Il),구평회(Koo, Pyung-Hoi) 대한산업공학회 2008 대한산업공학회 춘계학술대회논문집 Vol.2008 No.5

This paper considers a transporter scheduling problem under dynamic block transportation environment in shipbuilding. In dynamic situations, there exist the addition or cancellation of block transportation requirements, sudden breakdowns and maintenance of transporters. The transportation of the blocks in the shipyard has some distinct characteristics. Some blocks are available to be picked up at a specific time during the planning horizon while some other blocks need to be delivered before a specific time. These requirements cause two penalty times: 1) delay times incurred when a block is picked up after a required start time, and 2) tardy times incurred when a block shipment is completed after the required delivery time. The blocks are located at different areas in the shipyard and transported by transporters. The objective of this paper is to propose heuristic algorithms which minimize the weighted sum of empty transporter travel times, delay times, and tardy times. Four heuristic algorithms for transporter scheduling are proposed and their performance is evaluated.

할인구매옵션을 고려한 동적 재생산계획문제

이운식(Woon-Seek Lee) 한국경영과학회 2009 韓國經營科學會誌 Vol.34 No.3

This paper considers a remanufacturing and purchasing planning problem, in which either used products(or wastes) are remanufactured or remanufactured products(or final products) are purchased to satisfy dynamic demands of remanufactured products over a discrete and finite time horizon. Also, as remanufactured products are purchased more than or equal to a special quantity Q, a discount price policy is applied. The problem assumes that the related cost (remanufacturing and inventory holding costs of used products, and the purchasing and inventory holding costs of remanufactured products) functions are concave and backlogging is not allowed. The objective of this paper is to determine the optimal remanufacturing and purchasing policy that minimizes the total cost to satisfy dynamic demands of remanufactured products. This paper characterizes the properties of the optimal policy and then, based on these properties, presents a dynamic programming algorithm to find the optimal policy. Also, a network-based procedure is proposed for the case of a large quantity of low cost used products. A numerical example is then presented to demonstrate the procedure of the proposed algorithm.

폐기물 처분과 유한 재생산률을 고려한 동적 폐기물 회수계획 및 다종제품 재생산계획 문제

이운식(Woon-Seek Lee) 대한산업공학회 2016 대한산업공학회 춘계학술대회논문집 Vol.2016 No.4

This paper considers a withdrawing and remanufacturing planning problem, in which wastes can be withdrew at a period and also remanufactured at a period by any value in the set {0, P} where the rate P is the capacity of a remanufacturing facility. The withdrawal fee is occurred as a profit term that is proportional to the withdrawing container size(W). The inventory amounts of wastes can be disposal at the end of a period by incurring a disposal cost. The multiple products are remanufactured by each taking a fixed portion (0〈αi〈1) of the input wastes to satisfy dynamic demands of each product over a discrete and finite time horizon. Also, a start-up cost is only incurred at the first period of a remanufacturing block which is consecutively remanufactured. It is assumed that the related cost (inventory holding cost of the wastes, the remanufacturing and inventory holding costs of the remanufactured products) functions are concave and backlogging is not allowed. The objective of this paper is to simultaneously determine the optimal withdrawing and remanufacturing plans that minimize the total cost to satisfy dynamic demands of the multiple products. In this paper, the optimal solution properties are characterized and then, based on these properties, a dynamic programming algorithm is presented to find the optimal plan. Also, a network model is proposed to efficiently find the optimal solution to (u,v)- subproblems.

유한 재생산율을 갖는 동적 구매-재생산계획문제

이운식 ( Woon Seek Lee ),김병수 ( Byung Soo Kim ) 한국경영공학회 2011 한국경영공학회지 Vol.16 No.3

This paper considers a remanufacturing planning problem, in which the used products(or wastes) are purchased and the used products can be remanufactured at each period by any value in the set where the rate is the capacity of a remanufacturing facility. The remanufactured products are used to satisfy dynamic demands over a discrete and finite time horizon. Also, a start-up cost is only incurred at the first period of a remanufacturing block which is consecutively remanufactured. It is assumed that the related cost (purchasing and inventory holding costs of the used products, and the remanufacturing and inventory holding costs of the remanufactured products) functions are concave and backlogging is not allowed. The objective of this paper is to simultaneously determine the optimal purchasing plan for the used products and the optimal remanufacturing plan that minimize the total cost to satisfy dynamic demands of the remanufactured products. In this paper, the optimal solution properties are characterized and then, based on these properties, a dynamic programming algorithm is presented to find the optimal plan. Also, a network model is proposed to efficiently find the optimal solution to (u,v)-subproblems. A numerical example is introduced to demonstrate the procedure of the proposed algorithm.

제3자 물류센터 납품시간창 디스패칭 정책에 관한 효과

이운식(Woon-Seek Lee),김병수(Byung Soo Kim) 한국산업경영시스템학회 2014 한국산업경영시스템학회지 Vol.37 No.1

This paper considers an inbound ordering and outbound dispatching problem for multi-products and multi-vehicles in a third-party distribution center. The demands are dynamic over a discrete and finite time horizon, and replenishing orders are shipped in various transportation modes and the freight cost is proportional to the number of vehicles used. Any mixture of products is loaded onto any type of vehicles. The objective of the study is to simultaneously determine the inbound lot-sizes, the outbound dispatching sizes, and the types and numbers of vehicles used to minimize total costs, which consist of inventory holding cost and freight cost. Delivery time window is one of the general dispatching policies between a third-party distribution center and customers in practice. In the policy, each demand of product for a customer must be delivered within the time window without penalty cost. We derive mixed integer programming models for the dispatching policy with delivery time windows and on-time delivery dispatching policy, respectively and analyze the effect on a dispatching policy with delivery time windows by comparing with on-time delivery dispatching policy using various computational experiments.