• Title/Summary/Keyword: SPT Sequencing

Search Result 3, Processing Time 0.023 seconds

Chaotic Behavior of a Single Machine Scheduling Problem with an Expected Mean Flow Time Measure (기대 평균흐름시간 최소화를 위한 단일설비 일정계획의 성능변동 분석)

  • Joo, Un Gi
    • Journal of the Korean Operations Research and Management Science Society
    • /
    • v.41 no.1
    • /
    • pp.87-98
    • /
    • 2016
  • A single machine scheduling problem for jobs with stochastic processing time is considered in this study. Shortest processing time (SPT) sequencing according to the expected processing times of jobs is optimal for schedules with minimal expected mean flow time when all the jobs arrive to be scheduled and their expected processing times are known. However, SPT sequencing according to the expected processing time may not be optimal for the minimization of the mean flow time when the actual processing times of jobs are known. This study evaluates the complexity of SPT sequencing through a comparison of the mean flow times of schedules based on the expected processing times and actual processing times of randomly generated jobs. Evaluation results show that SPT sequencing according to the expected flow time exhibits chaotic variation to the optimal mean flow time. The relative deviation from the optimal mean flow time increases as the number of jobs, processing time, or coefficient of variation increases.

A Sequencing Algorithm for Order Processing by using the Shortest Distance Model in an Automated Storage/Retrieval Systems (자동창고시스템에 있어서 최단거리모형을 이용한 주문처리결정방법)

  • 박하수;김민규
    • Journal of Korean Society of Industrial and Systems Engineering
    • /
    • v.18 no.33
    • /
    • pp.29-37
    • /
    • 1995
  • An Automated Storage/Retrieval Systems(AS/RS) has been gradually emphasized because of the change of production and distribution environment. This paper develops algorithm and Shortest Distance Model that can reduce the traveling time of a stacker crane for efficient operation of AS/RS. In order to reduce the traveling time of a stacker crane, we determine the order processing and then the sequencing of storage/retrieval for each item. Order processing is determined based on the SPT(Shortest Processing Time) concept considering a criterion of retrieval coordinate. The sequencing of storage/retrieval is determined based on the Shortest Distance Model by using a modified SPP(Shortest Path Problem) of network problem. A numerical example is provided to illustrate the developed algorithm and Shortest Distance Model.

  • PDF

사람의 Serine palmitoryl transferase II 및 ceramidase의 promoter에 대한 연구

  • Kim, Hui-Suk;Song, Seong-Gwang;Lee, Eun-Yeol;Lee, Sang-Do;Linn, Steve;Merrill, Alfred H.
    • 한국생물공학회:학술대회논문집
    • /
    • 2000.04a
    • /
    • pp.588-591
    • /
    • 2000
  • Serine palmitoyl transferase(SPT) and ceramidase are the key enzymes in sphingolipid biosynthesis. To study sphingolipid metabolism, we have got the 5'-upstream regions of human serine palmitoyl transferase subunit II and acid ceramidase gene by using GenomeWalker kits(Clontech Co.). Human genomic DNA was purified from HT29, human colon canser cell line by using DNAzol. We got several bands after secondary PCR and subcloned them to T7bule vector. Human SPTII promoter which we got was 2690bp but we cut it with Bgl II and vector with Bgl II and BamH I, and subcloned 1782bp to pGL2-enhancer vector and pGL2-basic vector with luciferase reporter gene. Human acid ceramidase promoter which we got were 2028bp and 1034bp and subcloned to pGL2-enhancer vector and pGL2-basic vector. We transfected these promoters to HT29 cell and assayed luciferase activity. For measuring transfection efficiency, pRL-TK vector with seapancy luciferase reproter gene was cotransfected with these promoters.

  • PDF