• Title/Summary/Keyword: machine utilization

Search Result 399, Processing Time 0.021 seconds

A Case Study for Improving the Productivity of Assembly Line using Man-Machine Chart (Man-Machine Chart를 이용한 조립라인의 생산성 향상 사례 연구)

  • 정병용
    • Journal of the Korea Safety Management & Science
    • /
    • v.5 no.4
    • /
    • pp.187-194
    • /
    • 2003
  • The purpose of a man-machine chart is improved utilization of a man or a machine. Improved utilization can mean less idle time, rebalanced idle time, or less idle time of an excessive component. In this study we improved the productivity of the assembly line in the electronics company using man-machine chart. The results are applicable for improving the effectiveness of line balancing problems in the electronics industry.

A Dispatching Rule Considering Machine Utilization and Throughput under Finite Buffer Capacity (유한버퍼하에서 기계이용률과 산출량을 고려한 급송규칙)

  • Kim, Jong-Hwa;Cha, Sang-Soo
    • IE interfaces
    • /
    • v.15 no.3
    • /
    • pp.316-324
    • /
    • 2002
  • Automated Guided Vehicles are widely used as an essential material handling system for FMS to provide flexibility and efficiency. We suggest a new dispatching rule based on priority function which considers urgency and empty vehicle travel time under finite buffer capacity. We evaluate the performance of the proposed rule by comparing the performance of Shortest Travel Time/Distance(STT/D) rule in terms of machine utilization, throughput and WIP level using simulation. The simulation results show that the suggested dispatching rule is robust and provides better machine utilization, throughput with comparable WIP level compared to STT/D rule.

A Machine Learning Model Learning and Utilization Education Curriculum for Non-majors (비전공자 대상 머신러닝 모델 학습 및 활용교육 커리큘럼)

  • Kyeong Hur
    • Journal of Practical Engineering Education
    • /
    • v.15 no.1
    • /
    • pp.31-38
    • /
    • 2023
  • In this paper, a basic machine learning model learning and utilization education curriculum for non-majors is proposed, and an education method using Orange machine learning model learning and analysis tools is proposed. Orange is an open-source machine learning and data visualization tool that can create machine learning models by learning data using visual widgets without complex programming. Orange is a platform that is widely used by non-major undergraduates to expert groups. In this paper, a basic machine learning model learning and utilization education curriculum and weekly practice contents for one semester are proposed. In addition, in order to demonstrate the reality of practice contents for machine learning model learning and utilization, we used the Orange tool to learn machine learning models from categorical data samples and numerical data samples, and utilized the models. Thus, use cases for predicting the outcome of the population were proposed. Finally, the educational satisfaction of this curriculum is surveyed and analyzed for non-majors.

Utilization Analysis by Tool Allocation Method of the FMS (FMS의 공구배분법에 가동률 분석)

  • 허성관;하정진
    • Journal of the Korean Operations Research and Management Science Society
    • /
    • v.18 no.1
    • /
    • pp.19-28
    • /
    • 1993
  • A completely separated functional FMS (Flexible Manufacturing Systems), or a partly separated functional FMS, should be constructed because a fully functional FMS, where each machine has all of the tools required for procesing various kinds of jobs, is superflous and wasteful in meeting the multiform and changeable demands of comsumers in a flexible manner. The effective methods are presented in this study for allocating the tools to each machine in a two-machine flow shop type FMS to meet the above demands and to maximize the utilization of the FMS. The methods for a completely separated functional FMS having no duplicated tools and a partly separated functional FMS having some duplicated tools are proposed in this paper. Some simulation results clarify that utilization of the FMS by this methods is as high as the fully functional FMS when the number of jobs is large.

  • PDF

A SURVEY ON THE UTILIZATION OF AGRICULTURAL MACHINERY

  • Lee, Y.B.;Shin, S.Y.;Oh, I.S.;Kim, H.J.;Kim, B.G.
    • Proceedings of the Korean Society for Agricultural Machinery Conference
    • /
    • 2000.11b
    • /
    • pp.446-459
    • /
    • 2000
  • This study was carried out in order to find out an effective machinery utilization strategy by conducting a survey on utilization and maintenance of agricultural machinery. The survey showed that the no. of utilization hours for power tiller in a year was 190.2hrs, 208.6hrs for tractor, 59.1hrs for rice transplanter, 74.0 hrs for combine, 44.6 cultivator and 254.4hrs for 4.4hrs for grain dryer. The period covered the time the machine was until it became unserviceable. The results are as follows: 10.0yrs for power tiller, 7.5yrs for tractor, 7.4yrs for rice transplanter and 5.4yrs for combine. This indicate that the actual period of use for power tiller and rice transplanter was longer than the expected period of duration years so there is a need for adjustment. The factors considered by the farmers for purchasing agricultural machine were: farm size(32%), machine operation (26.0%), performance(l4.0%) and post or after sales service(12.6%), according to the survey. It showed that repair cost rate in a year was classified into major agricultural machine; 4.8% for combine; 3.9% for tractor; 3.5% for rice transplanter; 2.0% for power tiller; 1.6% for grain dryer; and 1.2% for cultivator. The reasons for poor maintenance were insufficient after sales service(25%) and difficulty in buying parts(75%) because of the unavailability of parts in local shops(55%), imported models(30%) and outmoded model(15%).

  • PDF

A Novel Method for Virtual Machine Placement Based on Euclidean Distance

  • Liu, Shukun;Jia, Weijia
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.10 no.7
    • /
    • pp.2914-2935
    • /
    • 2016
  • With the increasing popularization of cloud computing, how to reduce physical energy consumption and increase resource utilization while maintaining system performance has become a research hotspot of virtual machine deployment in cloud platform. Although some related researches have been reported to solve this problem, most of them used the traditional heuristic algorithm based on greedy algorithm and only considered effect of single-dimensional resource (CPU or Memory) on energy consumption. With considerations to multi-dimensional resource utilization, this paper analyzed impact of multi-dimensional resources on energy consumption of cloud computation. A multi-dimensional resource constraint that could maintain normal system operation was proposed. Later, a novel virtual machine deployment method (NVMDM) based on improved particle swarm optimization (IPSO) and Euclidean distance was put forward. It deals with problems like how to generate the initial particle swarm through the improved first-fit algorithm based on resource constraint (IFFABRC), how to define measure standard of credibility of individual and global optimal solutions of particles by combining with Bayesian transform, and how to define fitness function of particle swarm according to the multi-dimensional resource constraint relationship. The proposed NVMDM was proved superior to existing heuristic algorithm in developing performances of physical machines. It could improve utilization of CPU, memory, disk and bandwidth effectively and control task execution time of users within the range of resource constraint.

Storage & Retrieval Policies for S/R Machine with Capacity Constraints in Man-On-Board AS/RS (크레인의 능력을 고려한 MOB 자동창고 시스템의 저장과 불출정책)

  • Cho, Yong-Hwan;Sohn, Kwon-Ik
    • Journal of Industrial Technology
    • /
    • v.16
    • /
    • pp.217-230
    • /
    • 1996
  • This paper deals with storage and retrieval policies for S/R machine with capacity constraints in Man-On-Board AS/RS. It is assumed that storage sequence is based on SFC(spacefilling curve) routine and that storage layout is dedicated by storage policies. We present several heuristic algorithms for storage and retrieval policies which minimize total distance travelled by the S/R machine. These algorithms are based on COI, group COI, frequency of order, similarity between items and capacity of S/R machine. Experimental results of 24 combinastorial policies are provided to illustrate the performance of the heuristics under various rack utilization ratios. In storage policies, the results show that algorithms considering both similarity and frequency are better than those with COI as rack utilization is increasing. And algorithm using group COI is superior to others. In retrieval policies, the method with revision expression is shown to be better than others.

  • PDF

A Classification-Based Virtual Machine Placement Algorithm in Mobile Cloud Computing

  • Tang, Yuli;Hu, Yao;Zhang, Lianming
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.10 no.5
    • /
    • pp.1998-2014
    • /
    • 2016
  • In recent years, cloud computing services based on smart phones and other mobile terminals have been a rapid development. Cloud computing has the advantages of mass storage capacity and high-speed computing power, and it can meet the needs of different types of users, and under the background, mobile cloud computing (MCC) is now booming. In this paper, we have put forward a new classification-based virtual machine placement (CBVMP) algorithm for MCC, and it aims at improving the efficiency of virtual machine (VM) allocation and the disequilibrium utilization of underlying physical resources in large cloud data center. By simulation experiments based on CloudSim cloud platform, the experimental results show that the new algorithm can improve the efficiency of the VM placement and the utilization rate of underlying physical resources.

A Study on Scheduling Considering Delivery and Production Efficiency in the JIT Systems (적시생산시스템에서 납기와 생산효율성을 고려한 Scheduling)

  • Kim, Jung
    • Journal of Industrial Convergence
    • /
    • v.5 no.2
    • /
    • pp.21-32
    • /
    • 2007
  • This paper deals with the sequencing problem in the operation of the manufacturing systems with the constraint of buffer capacity. Some of studies for this theme have been progressed for several years. And then most of them considered only one objective, such as maximum lateness, machine utilization, makespan, mean flowtime and so on. This study deal with two objectives of the delivery for customers and the idle time of machines for producers. For the decision of sequence, the utility function is used. The developed heuristic algorithm presents a good solution. Through a numerical example, the procedures of the job sequencing is explained.

  • PDF

INTERACTIVE MACHINE LIADUNG AND TOOL ASSIGNMENT APPROAH IN FLEXIBLE MANUFACTURING SYSTEMS

  • Kato, Kiyoshi;Oba, Fuminori;Hashimoto, Fumio
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 1991.10b
    • /
    • pp.1576-1579
    • /
    • 1991
  • This paper discusses on the machine loading and tool allocation (MLTA) problem. Mathematical formulation of the problem is given first. Then a heuristic approach based on Group Technology (GT) is presented to deal with the MLTA problem effectively. By using this approach, part-tool group generation and their assignment to adequate machines can easily be obtained in consideration of the work load on each machine, the number of tool-set replacement, and the total number of cutting tools required through the interactive setting of the desired machine utilization rate.

  • PDF