• Title/Summary/Keyword: press line scheduling

Search Result 2, Processing Time 0.016 seconds

A Case Study of an Optimum Lot Size of Press Line (프레스 라인 적정 로트 크기의 결정에 관한 사례 연구)

  • Kim, Yearn-Min
    • IE interfaces
    • /
    • v.24 no.3
    • /
    • pp.241-247
    • /
    • 2011
  • This paper develops a mathematical model which searches an optimum lot size of a press line, and applies this model to the scheduling of the press line. This mathematical model is not a widely studied cost model but a model which considers the utilization of the press line under a lean production system. In this paper, the optimum lot size is a minimum lot size which does not exceed the total work time of the press line. A production volume and the priority of the production in the press line are adjusted using this optimum lot size. A mathematical model developed in this paper will allow determining the optimum lot size easily in case of variable production environments such as an introduction of a new product and a fluctuation of production volume of each item. Therefore, our model will make a better scheduling of the press line and will enhance the utilization of it.

Batch Scheduling Algorithm with Approximation of Job Completion Times and Case Studies (작업완료시각 추정을 활용한 배치 스케줄링 및 사례 연구)

  • Kim, Song-Eun;Park, Seong-Hyeon;Kim, Su-Min;Park, Kyungsu;Hwang, Min Hyung;Seong, Jongeun
    • Journal of Korean Society of Industrial and Systems Engineering
    • /
    • v.43 no.4
    • /
    • pp.23-32
    • /
    • 2020
  • Many small and medium-sized manufacturing companies process various product types to respond different customer orders in a single production line. To improve their productivity, they often apply batch processing while considering various product types, constraints on batch sizes and setups, and due date of each order. This study introduces a batch scheduling heuristic for a production line with multiple product types and different due dates of each order. As the process times vary due to the different batch sizes and product types, a recursive equation is developed based on a flow line model to obtain the upper bound on the completion times with less computational complexity than full computation. The batch scheduling algorithm combines and schedules the orders with same product types into a batch to improve productivity, but within the constraints to match the due dates of the orders. The algorithm incorporates simple and intuitive principles for the purpose of being applied to small and medium companies. To test the algorithm, two case studies are introduced; a high pressure coolant (HPC) manufacturing line and a press process at a plate-type heat exchanger manufacturer. From the case studies, the developed algorithm provides significant improvements in setup frequency and thus convenience of workers and productivity, without violating due dates of each order.