• 제목/요약/키워드: Setup cost

검색결과 222건 처리시간 0.026초

작업순서에 따라 달라지는 준비 비용을 갖는 PCB 생산 공정의 일정계획 (Scheduling of Production Process with Setup Cost depending Job Sequence)

  • 유성열
    • 경영과정보연구
    • /
    • 제34권2호
    • /
    • pp.67-78
    • /
    • 2015
  • 본 연구는 작업 순서에 따라 달라지는 준비비용을 갖는 인쇄회로기판의 생산 일정계획 문제를 다룬다. 본 연구에서 다루는 문제는 생산할 인쇄회로기판의 유형들이 주어져있으며, 이는 한 대의 부품장착 설비를 통해 생산되는 환경에서, 작업 투입 순서에 따라 달라지는 준비 비용의 총합을 최소화는 작업 투입순서를 결정하는 것이다. 이 문제는 NP-hard로 알려져 있으며, 이에 해를 도출하기 위한 메타 휴리스틱 기법을 제시한다.

  • PDF

V-그루브 미세가공에서의 공구 및 공작물 셋업 해석 (Analysis of Tool and Workpiece Setup in v-Groove Micromachining)

  • 조정우;양민양
    • 대한기계학회논문집A
    • /
    • 제30권8호
    • /
    • pp.957-964
    • /
    • 2006
  • As the requirement of LCD products which are large screen and have high brightness increases, the role of light guide panel (LGP) of which micro-features diffuse the light uniformly on surface is getting important. In general, there are many errors in machining like machine tool errors process error, setup error and etc. The amount of setup error in general machining is not so big in comparison with the others, so it is mostly neglected. But, especially in v-groove micromachining, setup error has a significant effect on micro-features. Low quality product and high cost are resulted from setup error. In v-groove micromachining, to confirm the effect of setup error, it is identified and then setup error synthesis model is derived from analysis of tool and workpiece setup. In addition, to predict the micro-features affected by setup error and enhance the production efficiency, the setup condition satisfying the tolerance of micro-features is geometrically analyzed and presented.

Branch and Bound Approach for Single-Machine Sequencing with Early/Tardy Penalties and Sequence-Dependent Setup Cost

  • Akjiratikarl, Chananes;Yenradee, Pisal
    • Industrial Engineering and Management Systems
    • /
    • 제3권2호
    • /
    • pp.100-115
    • /
    • 2004
  • The network representation and branch and bound algorithm with efficient lower and upper bounding procedures are developed to determine a global optimal production schedule on a machine that minimizes sequence-dependent setup cost and earliness/tardiness penalties. Lower bounds are obtained based on heuristic and Lagrangian relaxation. Priority dispatching rule with local improvement procedure is used to derive an initial upper bound. Two dominance criteria are incorporated in a branch and bound procedure to reduce the search space and enhance computational efficiency. The computational results indicate that the proposed procedure could optimally solve the problem with up to 40 jobs in a reasonable time using a personal computer.

납기와 작업준비비용을 고려한 병렬기계에서 딥러닝 기반의 일정계획 생성 모델 (Scheduling Generation Model on Parallel Machines with Due Date and Setup Cost Based on Deep Learning)

  • 유우식;서주혁;이동훈;김다희;김관호
    • 한국전자거래학회지
    • /
    • 제24권3호
    • /
    • pp.99-110
    • /
    • 2019
  • 4차 산업혁명이 진행되면서 제조업에서 사물인터넷(IoT), 머신러닝과 같은 지능정보기술을 적용하는 사례가 증가하고 있다. 반도체/LCD/타이어 제조공정에서는 납기일(due date)을 준수하면서 작업물 종류 변경(Job change)으로 인한 작업 준비 비용(Setup Cost)을 최소화하는 일정계획을 수립하는 것이 효과적인 제품 생산을 위해 매우 중요하다. 따라서 본 연구에서는 병렬기계에서 딥러닝 기반의 납기 지연과 작업 준비 비용 최소화를 달성하는 일정계획 생성 모델을 제안한다. 제안한 모델은 과거의 많은 데이터를 이용하여 고려되어지는 주문에 대해 작업 준비와 납기 지연을 최소화하는 패턴을 학습한다. 따라서 세 가지 주문 리스트의 난이도에 따른 실험 결과, 본 연구에서 제안한 기법이 기존의 우선순위 규칙보다 성능이 우수하다는 것을 확인하였다.

Process Reliability Improvement and Setup Cost Reduction in Imperfect Production System

  • Lee, Chang-Hwan
    • 한국경영과학회지
    • /
    • 제22권4호
    • /
    • pp.93-113
    • /
    • 1997
  • In studying an EOQ-like inventory model for a manufacturing process, a number of findings were made. The system can "go out of control" resulting in a relatively minor problem state or "break-down". When the production system is in the minor problem statei produces a number of defective items. It is assumed that each defective piece requires rework cost and related operations. Once the machine breakdown takes place, the production system produces severely defective items that are completely unusable. Each completely unusuable item is immediately discarded and incurs handling cost, scrapped raw material cost and related operations. Two investment options in improving the production process are introduced : (1) reducing the probability of machine breakdown, breakdowns, and (2) simultaneously reducing the probability of machine breakdowns and setup costs. By assuming specific forms of investment cost function, the optimal investment policies are obtained explicitly. Finally, to better understand the model in this paper, the sensitivity of these solutions to changes in parameter values and numerical examples are provided.amples are provided.

  • PDF

납기 위반 및 셋업 최소화를 위한 강화학습 기반의 설비 일정계획 모델 (Machine Scheduling Models Based on Reinforcement Learning for Minimizing Due Date Violation and Setup Change)

  • 유우식;서주혁;김다희;김관호
    • 한국전자거래학회지
    • /
    • 제24권3호
    • /
    • pp.19-33
    • /
    • 2019
  • 최근 제조업체들은 제품의 생산방식이 고도화 되고, 복잡해지면서 생산 장비를 효율적으로 사용하는데 어려움을 겪고 있다. 제조공정의 효율성을 방해하는 대표적인 요인들로는 작업물 종류 변경(job change)으로 인한 작업 준비 비용(Setup Cost) 등이 있다. 특히 반도체/LCD 공정과 같이 고가의 생산 장비를 사용하는 공정의 경우 장비의 효율적인 사용이 매우 중요한데, 상호 충돌하는 의사결정인 납기 준수를 최대화 하는 것과 작업물 종류 변경으로 인한 작업 준비 비용을 최소화 하는 것 사이에서 균형을 유지하는 것은 매우 어려운 일이다. 본 연구에서는 납기와 작업 준비 비용이 있는 병렬기계에서 강화학습을 활용하여 납기 및 셋업 비용의 최소화 목표를 달성하는 일정계획 모델을 개발하였다. 제안하는 모델은 DQN(Deep Q-Network) 일정계획 모델로 강화학습기반의 모델이다. 제안모델의 효율성을 측정하기 위해 DQN 모델과 기존에 개발하였던 심층 신경망 기반의 일정계획 생성기법과 휴리스틱 원칙의 결과를 비교하였다. 비교 결과 DQN 일정계획 생성기법이 심층신경망 방식과 휴리스틱 원칙에 비하여 납기 및 셋업 비용이 적은 것을 확인할 수 있었다.

반도체 생산 배취공정에서의 배취 크기의 결정 (Batch Sizing Heuristic for Batch Processing Workstations in Semiconductor Manufacturing)

  • 천길웅;홍유신
    • 대한산업공학회지
    • /
    • 제22권2호
    • /
    • pp.231-245
    • /
    • 1996
  • Semiconductor manufacturing line includes several batch processes which are to be controlled effectively to enhance the productivity of the line. The key problem in batch processes is a dynamic batch sizing problem which determines number of lots processed simultaneously in a single botch. The batch sizing problem in semiconductor manufacturing has to consider delay of lots, setup cost of the process, machine utilization and so on. However, an optimal solution cannot be attainable due to dynamic arrival pattern of lots, and difficulties in forecasting future arrival times of lots of the process. This paper proposes an efficient batch sizing heuristic, which considers delay cost, setup cost, and effect of the forecast errors in determining the botch size dynamically. Extensive numerical experiments through simulation are carried out to investigate the effectiveness of the proposed heuristic in four key performance criteria: average delay, variance of delay, overage lot size and total cost. The results show that the proposed heuristic works effectively and efficiently.

  • PDF

종속적 준비시간을 갖는 다단계 그룹가공 생산시스템에서의 그룹스케듈링에 관한 연구 (On the Multi-Stage Group Scheduling with Dependent Setup Time)

  • 황문영
    • 산업경영시스템학회지
    • /
    • 제17권31호
    • /
    • pp.115-123
    • /
    • 1994
  • Group scheduling, which is a kind of operations scheduling based on the GT concept is analyzed in a multi-stage manufacturing system. The purpose of this research is to develop and evaluate a heuristic algorithm for determining gro up sequence and job sequence within each group to minimize a complex cost function, i.e. the sum of the total pe-nalty cost for tardiness and the total holding cost for flow time, in a multi-stage manufacturing system with group setup time dependent upon group sequence. A heuristic algorithm for group sc heduling is developed, and a numerical example is illustrated. For the evaluation of the pro-posed heuristic algorithm, the heuristic solution of each of 63 problems is compared with that of random scheduling. The result shows that the proposed heuristic algorithm provides better solution in light of the proposed cost function.

  • PDF

공급업체 수가 주문 생산 제조 기업의 재고 관리에 미치는 영향 분석 (The Impacts of the Number of Suppliers on Inventory Management in a Make-to-order Manufacturer)

  • 김은갑
    • 산업공학
    • /
    • 제23권4호
    • /
    • pp.327-336
    • /
    • 2010
  • We consider a supply chain consisting of a make-to-order manufacturer and N component suppliers and study the impacts of the number of suppliers on component inventory management. The manufacturer has full information and continuously observes the state of both component inventory level and customer backorders. Based on this information, the manufacturer determines whether or not to place a component purchasing order to a supplier among N suppliers even though some orders are in process by other suppliers. The goal of this paper is to numerically identify the manufacturer's purchasing policy which minimizes the total supply chain cost and the best choice of N. Our model contributes to the current literature in that the problem of simultaneously considering multiple outstanding orders and incorporating order setup cost into the model has not been covered yet. From numerical experiment, we investigate how much the policy with N suppliers can contribute to reducing the supply cost compared to the policy with a single supplier.

SYNCHRONIZING INDIVIDUALLY OPTIMAL CYCLE TIMES ACROSS MULITI-BUYERS AND MULTI-PRODUCTS

  • Lee, Chang-Hwan
    • Management Science and Financial Engineering
    • /
    • 제4권2호
    • /
    • pp.15-42
    • /
    • 1998
  • A joint problem of order delivery, setup reduction, and cost-sharing in a two-echelon inventory system in which a vendor supplies multiple products to a group of buyers is studied here. The basic premise is that buyers have independently implemented setup reduction programs to acquire benefits from small order sizes. Doing so, however, causes the buyers' individually optimal order cycles to be differ from that of the vendor. In conjunction with this, two models are considered. In the first model, a multi-buyers single product situation is considered in which the vendor implements a joint supply cycle policy. However, buyers, as the dominant party, insist after implementing the individually optimal setup reduction that the vendor accept their individually optimal order schedules. In the second model. a multi-products, single buyer situation is considered in which the buyer implements a joint order policy. Here, the vendor, as the dominant party, refuses to cooperate fully with the buyer's individually reduced joint order schedule, and designs his own individually optimal setup reduction mix for each product under a given budget constraint. This led to a study of an integrated Setup Reduction/Break-even Pricing Policy for each situation to eliminate mismatches in individually optimal cycle times.

  • PDF