• Title/Summary/Keyword: single machine

Search Result 1,242, Processing Time 0.028 seconds

Single nucleotide polymorphism marker combinations for classifying Yeonsan Ogye chicken using a machine learning approach

  • Eunjin, Cho;Sunghyun, Cho;Minjun, Kim;Thisarani Kalhari, Ediriweera;Dongwon, Seo;Seung-Sook, Lee;Jihye, Cha;Daehyeok, Jin;Young-Kuk, Kim;Jun Heon, Lee
    • Journal of Animal Science and Technology
    • /
    • v.64 no.5
    • /
    • pp.830-841
    • /
    • 2022
  • Genetic analysis has great potential as a tool to differentiate between different species and breeds of livestock. In this study, the optimal combinations of single nucleotide polymorphism (SNP) markers for discriminating the Yeonsan Ogye chicken (Gallus gallus domesticus) breed were identified using high-density 600K SNP array data. In 3,904 individuals from 198 chicken breeds, SNP markers specific to the target population were discovered through a case-control genome-wide association study (GWAS) and filtered out based on the linkage disequilibrium blocks. Significant SNP markers were selected by feature selection applying two machine learning algorithms: Random Forest (RF) and AdaBoost (AB). Using a machine learning approach, the 38 (RF) and 43 (AB) optimal SNP marker combinations for the Yeonsan Ogye chicken population demonstrated 100% accuracy. Hence, the GWAS and machine learning models used in this study can be efficiently utilized to identify the optimal combination of markers for discriminating target populations using multiple SNP markers.

SINGLE-MACHINE SCHEDULING PROBLEMS WITH AN AGING EFFECT

  • Zhao, Chuan-Li;Tang, Heng-Yong
    • Journal of applied mathematics & informatics
    • /
    • v.25 no.1_2
    • /
    • pp.305-314
    • /
    • 2007
  • This paper considers single machine scheduling problems where the processing time of a job increases as a function of its position in the sequence. In this model, the later a given job is scheduled in the sequence, the longer its processing time. It is shown that the optimal schedule may be very different from that of the classical version of the problem. We introduce polynomial solutions for the makespan minimization problem, the sum of completion times minimization problem and the sum of earliness penalties minimization problem. For two resource constrained problems, based on the analysis of the problems, the optimal resource allocation methods are presented, respectively.

Single Machine Scheduling Problem with Step-deterioration under A Rate-modifying Activity (단일 복구조정활동 하에 단계적 퇴화를 가지는 단일기계 생산일정계획)

  • Kim, Byung Soo
    • Journal of Korean Society of Industrial and Systems Engineering
    • /
    • v.37 no.3
    • /
    • pp.43-50
    • /
    • 2014
  • In this paper, we deal with a single machine scheduling problems integrating with step deterioration effect and a rate-modifying activity (RMA). The scheduling problem assumes that the machine may have a single RMA and each job has the processing time of a job with deterioration is a step function of the gap between recent RMA and starting time of the job and a deteriorating date that is individual to all jobs. Based on the two scheduling phenomena, we simultaneously determine the schedule of step deteriorating jobs and the position of the RMA to minimize the makespan. To solve the problem, we propose a hybrid typed genetic algorithm compared with conventional GAs.

Heuristic Algorithm for the Single-machine Scheduling with Periodic Maintenance (주기정비를 고려한 단일기계 일정계획을 위한 휴리스틱 알고리즘 설계)

  • Lee, Sang-Heon;Lee, In-Gu
    • Journal of Korean Institute of Industrial Engineers
    • /
    • v.34 no.3
    • /
    • pp.318-327
    • /
    • 2008
  • This paper considers a single-machine scheduling problem with availability constraints. In many realistic situations, machines may not be always available due to various reasons such as maintenance, breakdown and repair. However, most literature on scheduling assume that the machines are available at all times. This paper deals with a single-machine scheduling problem with periodic maintenance. If the maintenance decision is made jointly with the job scheduling, the system will be more effective. The objective is to minimize the total completion time of jobs. This problem is proved to be NP-hard in the strong sense. The proposed breaking heuristic(BH) algorithm rule is established by some theorems and conditions. Our computational results show that the BH algorithm is much more efficient than existing heuristic.

SINGLE MACHINE GROUP SCHEDULING UNDER DECREASING LINEAR DETERIORATION

  • Wang, Ji-Bo;Guo, Ai-Xia;Shan, Feng;Jiang, Bo;Wang, Li-Yan
    • Journal of applied mathematics & informatics
    • /
    • v.24 no.1_2
    • /
    • pp.283-293
    • /
    • 2007
  • This paper considers single machine scheduling problems with group technology (GT) and deteriorating jobs. A sequence independent setup is required to process a job from a different group and jobs in each group are processed together. We consider the case of jobs whose processing times are a decreasing function of their starting time. The objectives of scheduling problems are to minimize the makespan and the total completion time, respectively. We also provide polynomial time algorithms to solve these problems.

Control of Single Propeller Pendulum with Supervised Machine Learning Algorithm

  • Tengis, Tserendondog;Batmunkh, Amar
    • International journal of advanced smart convergence
    • /
    • v.7 no.3
    • /
    • pp.15-22
    • /
    • 2018
  • Nowadays multiple control methods are used in robot control systems. A model, predictor or error estimator is often used as feedback controller to control a robot. While robots have become more and more intensive with algorithms capable to acquiring independent knowledge from raw data. This paper represents experimental results of real time machine learning control that does not require explicit knowledge about the plant. The controller can be applied on a broad range of tasks with different dynamic characteristics. We tested our controller on the balancing problem of a single propeller pendulum. Experimental results show that the use of a supervised machine learning algorithm in a single propeller pendulum allows the stable swing of a given angle.

Single-Machine Total Completion Time Scheduling with Position-Based Deterioration and Multiple Rate-Modifying Activities

  • Kim, Byung-Soo;Joo, Cheol-Min
    • Industrial Engineering and Management Systems
    • /
    • v.10 no.4
    • /
    • pp.247-254
    • /
    • 2011
  • In this paper, we study a single-machine scheduling problem with deteriorating processing time of jobs and multiple rate-modifying activities which reset deteriorated processing time to the original processing time. In this situation, the objective function is to minimize total completion time. First, we formulate an integer programming model. Since the model is difficult to solve as the size of real problem being very large, we design an improved genetic algorithm called adaptive genetic algorithm (AGA) with spontaneously adjusting crossover and mutation rate depending upon the status of current population. Finally, we conduct some computational experiments to evaluate the performance of AGA with the conventional GAs with various combinations of crossover and mutation rates.

The speed control of the Single-Phase induction motor using P-I controller (비례 - 적분 제어기를 이용한 단상 유도 전동기의 속도 제어)

  • Sang, Doo-Whan;Cheong, Dal-Ho;Kim, Jung-Chul;Oh, Min-Jin
    • Proceedings of the KIEE Conference
    • /
    • 1994.07a
    • /
    • pp.603-605
    • /
    • 1994
  • The Single-Phase induction motor is widely used in home appliances, especially refrigerator, air conditioner and washing machine. Recently many home appliances that use the motor require the speed control to get the various and convenient functions for the customers. Generally it is so hard to control the speed of the Single-Phase induction motor and to get the wide range of the speed variation. In this raper, the speed controller using P-I is designed for the Single-Phase induct ion Motor. The experimental results of the phase controller using P-I show the wide speed control of the Single-Phase induction motor and rebuff control to load change.

  • PDF

A Development of Shoes Cleaner Control System using Raspberry Pi

  • Deukchang Hyun
    • Journal of the Korea Society of Computer and Information
    • /
    • v.29 no.7
    • /
    • pp.21-32
    • /
    • 2024
  • Since leather shoes cannot be washed with water, there is a need for a cleaning method that can remove extraneous substance from the inside and outside of shoes and senitize the inside of shoes without using water. For this purpose, this paper develops a shoes cleaning machine control system that automatically controls the entire process of shoes cleaning in a shoes cleaning machine that quickly cleans the inside and outside of shoes using compressed air, sterilization solution. The developed system uses Rasberry Pi, a general purpose single board computer(SBC), to control various actuators of the shoes cleaning machine. The shoes cleaning machine operated by the developed system shows a sterilization efficiency of more than 99% and an odor removal efficiency of more than 86% in a cleaning time of less than 1 minute.

The development of Inspection Machine for a blood virus infection (바이러스 감염 판별용 혈액 검사기 개발)

  • Jun, Jae-Min;Seo, Kyu-Tae;Lee, Bo-Hee;Lee, In-Koo;Min, Seung-Ki;Kim, Hak-Jun
    • Proceedings of the KIEE Conference
    • /
    • 2004.11c
    • /
    • pp.465-467
    • /
    • 2004
  • This paper deals with the design and analysis of automatic virus infection machine, which can be used in blood testing at veterinary hospital. It consists of the mechanical positioning parts and electrical control parts. Two of driving motor and ball screws are used to move the liquid container into the test position and mix the blood on litmus paper. In addition, a thermal controller is installed to keep the container temperature on constant level. The user interface using with a LCD and some keys are supplied with a 8-bit single chip controller. All of the designs issue related with the mechanism and controllers are discussed in detail. Finally the proposed machine is tested in real experiment with the formal processing to judge the virus infection, and also the usefulness of designed algorithm is verified through the experiments.

  • PDF