• 제목/요약/키워드: capacitated supply chain

검색결과 18건 처리시간 0.027초

공급능력제약이 존재하는 2단계 공급체인에서 반품정책의 효과성에 대한 동적 시뮬레이션 (A Dynamic Simulation on the Effectiveness of Return Policy in a Capacitated Two-echelon Supply Chain)

  • 김태현;박정훈;정현목
    • 한국시스템다이내믹스연구
    • /
    • 제9권2호
    • /
    • pp.5-25
    • /
    • 2008
  • This paper analysed the impact of return policy as a coordination mechanism for decentralized supply chain with one capacitated supplier and two competing retailers under random demand distribution. In this study, Shortage gaming also considered to reflect a competing environment of two retailers. System dynamics approach was used to model the baseline two echelon supply chain and return policy on it. Given each of 4 experiment settings being used for 100 simulations with different random seeds, 400 random samples were used in a t-test. The result show that return policy significantly enhance the supply chain profits and fillrates. The analysis suggest that the supply chain performance can be build up by implementing a return policy even though under consideration of a capacitated supplier and competing retailers.

  • PDF

자원제약하의 다단계 다품목 공급사슬망 생산계획을 위한 휴리스틱 알고리즘 (A Hybrid Heuristic Approach for Supply Chain Planningwith n Multi-Level Multi-Item Capacitated Lot Sizing Model)

  • 신현준
    • 한국산학기술학회논문지
    • /
    • 제7권1호
    • /
    • pp.89-95
    • /
    • 2006
  • 공급사슬망에서 분산되어있는 제조시스템에 대한 생산 계획수립은 공급사슬관리의 주요 연구분야 중의 하나이다. 본 논문은 공급사슬망에서 자원제약을 갖는 다단계 다품목 로트사이즈 결정 문제(Multi-Level, multi-item Capacitated Lot Sizing Problem: MLCLSP)를 위한 알고리즘을 제시한다. MLCLSP는 MIP(mixed integer program) 문제에 해당한다. 제안된 알고리즘은 휴리스틱과 최적화 패키지인 LINGO를 이용해 서로 반복적인 방식으로 해를 풀어나가는 혼성적인 성격을 갖는다. 휴리스틱을 이용하여 정수형 변수를 결정한 후, 얻게 되는 LP(linear program) 문제를 LINGO를 이용하여 해를 개선해 나가는 방식을 기본으로 한다. 본 논문에서는 탐색 휴리스틱 기법으로 임의 재시작 타부탐색 알고리즘을 제시한다. 다양한 시나리오의 실험을 통해 제안된 알고리즘들의 성능을 평가한다.

  • PDF

생산 능력 제한이 존재하는 다단계 공급망을 위한 Look-ahead 기반의 분배계획 (Look-ahead Based Distribution Planning for Capacitated Multi-stage Supply Chains)

  • 노주석;권익현;김성식
    • 대한안전경영과학회지
    • /
    • 제8권5호
    • /
    • pp.139-150
    • /
    • 2006
  • The aim of this study is to establish an efficient distribution planning for a capacitated multi-stage supply chain. We assume that the demand information during planning horizon is given a deterministic form using a certain forecasting method. Under such a condition, we present a cost effective heuristic method for minimizing chain-wide supply chain inventory cost that is the sum of holding and backorder costs by using look-ahead technique. We cope with the capacity restriction constraints through look-ahead technique that considers not only the current demand information but also future demand information. To evaluate performance of the proposed heuristic method, we compared it with the extant research that utilizes echelon stock concept, under various supply chain settings.

용량제약이 있는 복수 순회구매자 문제의 휴리스틱 해법 (Heuristic Approach for the Capacitated Multiple Traveling Purchaser Problem)

  • 최명진;이상헌
    • 산업공학
    • /
    • 제24권1호
    • /
    • pp.51-57
    • /
    • 2011
  • The traveling purchaser problem (TPP) is a generalization of the well-known traveling salesman problem (TSP), which has many real-world applications such as purchasing the required raw materials for the manufacturing factories and the scheduling of a set of jobs over some machines, and many others. In the last decade, TPP has received some attention of the researchers in the operational research area. However, all of the past researches for TPP are restricted on a single purchaser (vehicle). It could be the limitation to solve the real world problem. The purpose of this paper is to suggest the capacitated multiple TPP (CMTPP). It could be used in inbound logistics optimization in supply chain management area and many others. Since TPP is known as NP-hard, we also developed the heuristic algorithm to solve the CMTPP.

GRASP 기법을 이용한 주문이월과 자원제약을 고려한 공급사슬 망에서의 생산계획 알고리즘 (A Production Planning Algorithm for a Supply Chain Network Considering Bark-Order and Resource Capacity Using GRASP Method)

  • 신현준;이영섭
    • 산업경영시스템학회지
    • /
    • 제32권3호
    • /
    • pp.29-39
    • /
    • 2009
  • In an environment of global competition, the success of a manufacturing corporation is directly related to how it plans and executes production in particular as well as to the optimization level of its process in general. This paper proposes a production planning algorithm for the Multi-Level, multi-item Capacitated Lot Sizing Problem (MLCLSP) in supply chain network considering back-order. MLCLSP corresponds to a mixed integer programming (MIP) problem and is NP-hard. Therefore, this paper proposes an effective algorithm, GRHS (GRASP-based Rolling Horizon Search) that solves this problem within reasonable computational time and evaluates its performance under a variety of problem scenarios.

타부 탐색을 이용한 생산능력 제한하의 공급망 분배계획 (Distribution Planning for Capacitated Supply Chains Using Tabu Search Approach)

  • 권익현;백종관;김성식
    • 산업공학
    • /
    • 제18권1호
    • /
    • pp.63-72
    • /
    • 2005
  • In this paper, we present a distribution planning method for a supply chain. Like a typical distribution network of manufacturing firms, we have the form of arborescence. To consider more realistic situation, we investigated that an outside supplier has limited capacity. The customer demands are given in deterministic form in finite number of discrete time periods. In this environment, we attempt to minimize the total costs, which is the sum of inventory holding and backorder costs over the distribution network during the planning horizon. To make the best of the restricted capacity, we propose the look-ahead feature. For looking ahead, we convert this problem into a single machine scheduling problem and utilize tabu search approach to solve it. Numerous simulation tests have shown that the proposed algorithm performs quite well.

공급능력제약이 존재하는 분권화된 공급체인의 조정메커니즘 (Coordination Mechanisms for Decentralized Supply Chain in a Capacitated Distribution Network)

  • 박정훈;최동현;김성태
    • 한국시스템다이내믹스연구
    • /
    • 제13권1호
    • /
    • pp.81-112
    • /
    • 2012
  • This study investigate the impact of supply chain contracts on supply chain performance. This study employed Price adjustment contract(PAC) and Quantity adjustment contract(QAC) as two main types of a vertical coordination mechanism. We simulate different types of coordination mechanisms with various degrees of demand uncertainties and several capacity tightness scenarios. This study shows that PAC and QAC significantly enhance the supply chain profits and fill rates suggesting that supply chain performance can be improved by implementing a proper coordination mechanism depends on the level of a capacity tightness and demand uncertainty.

  • PDF

생산 및 배송을 위한 공급사슬망에서의 일정계획에 관한 연구 (A Scheduling Problem for Production-Delivery in a Supply Chain)

  • 윤상흠;이익선
    • 한국경영과학회지
    • /
    • 제31권4호
    • /
    • pp.35-47
    • /
    • 2006
  • This paper considers an integrated scheduling problem for consecutive production and delivery stages in a two-stage supply chain. The Production is performed on a single facility and then the finished products are delivered to the customer by capacitated multiple vehicles. The objective of this paper is to obtain job sequencing and delivery batching minimizing the total cost of the associated WIP inventory, finished product inventory and delivery. The inventory cost is characterized by the sum of weighted flowtime. The delivery cost is proportional to the required number of delivery batches. Some polynomial-solvable cases are derived. For the general case, two efficient heuristic algorithms are suggested, and then the heuristics are tested through some numerical experiments.

생산 능력 제한이 있는 다계층 공급사슬의 분배계획을 위한 발견적 기법 (Heuristic for Distribution Planning in Capacitated Multi-echelon Supply Chains)

  • 권익현;신현준;김성식
    • 산업공학
    • /
    • 제19권2호
    • /
    • pp.124-132
    • /
    • 2006
  • The system under study is a single item, multi-echelon distribution system with a capacitated production facility. All the nodes at the downstream ends are demand-sites, i.e., ordered items are delivered to the customers from the node. Also any transshipment depots in the midstream can be demand-sites as well. For a given planning period, at each of demand-site, demand is forecasted and known. Our objective is to minimize the average system cost per period which is the sum of holding and backorder costs in the entire network. Due to the capacity restrictions, it is difficult to establish efficient distribution planning. To overcome such a difficulty and obtain a reasonable and better solution, we convert this problem into a single machine earliness and weighted tardiness scheduling. We propose a simple but cost-effective heuristic for this problem. The experimental results showed that the proposed heuristic obtained much better solutions compared with another approach.

로봇 산업의 다중 공급망 환경을 고려한 생산 및 분배 관리를 위한 유전 알고리듬 개발 (Development of Genetic Algorithm for Production and Distribution Management in Multiple Supplier Network Environment of Robot Engineering Industry)

  • 조성민;김태영;황승준
    • Journal of Information Technology Applications and Management
    • /
    • 제20권2호
    • /
    • pp.147-160
    • /
    • 2013
  • Today, the management environments of intelligence firm are changing the way of production planning and logistics management, and are changing the process of supply chain management system. This paper shows the development of information system software for intelligence enterprises is used in supply chain management for robot engineering industry. Specifically, supply chain management system in this paper has been developed to analyze the impact of multi plant and multi distribution environment, showing the process analysis and system development of hierarchical assembly manufacturing industry. In this paper we consider a production planning and distribution management system of intelligence firm in the supply chain. We focus on a capacitated production resource and distribution volume allocation problem, develop a mixed integer programming model, and propose an efficient heuristic procedure using a genetic algorithm to solve it efficiently. This method makes it possible for the population to reach the feasible approximate solution easily. The proposed regeneration procedures, which evaluate each infeasible chromosome, makes the solution converge to the feasible approximate solution quickly.