• Title/Summary/Keyword: 로트-스트리밍

Search Result 4, Processing Time 0.017 seconds

No-Wait Lot-Streaming Flow Shop Scheduling (비정체 로트 - 스트리밍 흐름공정 일정계획)

  • Yoon, Suk-Hun
    • IE interfaces
    • /
    • v.17 no.2
    • /
    • pp.242-248
    • /
    • 2004
  • Lot-streaming is the process of splitting a job (lot) into a number of smaller sublots to allow the overlapping of operations between successive machines in a multi-stage production system. A new genetic algorithm (NGA) is proposed for minimizing the mean weighted absolute deviation of job completion times from due dates when jobs are scheduled in a no-wait lot-streaming flow shop. In a no-wait flow shop, each sublot must be processed continuously from its start in the first machine to its completion in the last machine without any interruption on machines and without any waiting in between the machines. NGA replaces selection and mating operators of genetic algorithms (GAs), which often lead to premature convergence, by new operators (marriage and pregnancy operators) and adopts the idea of inter-chromosomal dominance. The performance of NGA is compared with that of GA and the results of computational experiments show that NGA works well for this type of problem.

Lot-Streaming Flow Shop Problem with Delivery Windows (딜리버리 윈도우 로트-스트리밍 흐름 공정 문제)

  • Yoon, Suk-Hun
    • Journal of Korean Institute of Industrial Engineers
    • /
    • v.30 no.2
    • /
    • pp.159-164
    • /
    • 2004
  • Lot-streaming is the process of splitting a job (lot) into a number of smaller sublots and then scheduling these sublots in order to accelerate the completion of jobs in a multi-stage production system. Anew genetic algorithm (NGA) is proposed for an-job, m-machine, equal-size sublot lot-streaming flow shop scheduling problem with delivery windows in which the objective is to minimize the mean weighted absolute deviation of job completion times from due dates. The performance of NGA is compared with that of an adjacent pairwise interchange (API) method and the results of computational experiments show that NGA works well for this type of problem.

On Lot-Streaming Flow Shops with Stretch Criterion (로트 스트리밍 흐름공정 일정계획의 스트레치 최소화)

  • Yoon, Suk-Hun
    • Journal of Korean Society of Industrial and Systems Engineering
    • /
    • v.37 no.4
    • /
    • pp.187-192
    • /
    • 2014
  • Lot-streaming is the process of splitting a job (lot) into sublots to allow the overlapping of operations between successive machines in a multi-stage production system. A new genetic algorithm (NGA) is proposed for an n-job, m-machine, lot-streaming flow shop scheduling problem with equal-size sublots in which the objective is to minimize the total stretch. The stretch of a job is the ratio of the amount of time the job spent before its completion to its processing time. NGA replaces the selection and mating operators of genetic algorithms (GAs) by marriage and pregnancy operators and incorporates the idea of inter-chromosomal dominance and individuals' similarities. Extensive computational experiments for medium to large-scale lot-streaming flow-shop scheduling problems have been conducted to compare the performance of NGA with that of GA.

Minimizing the Total Stretch when Scheduling Flows of Divisible Requests without Interruption (총 스트레치 최소화를 위한 분할 가능 리퀘스트 흐름 스케줄링)

  • Yoon, Suk-Hun
    • The Journal of Society for e-Business Studies
    • /
    • v.20 no.1
    • /
    • pp.79-88
    • /
    • 2015
  • Many servers, such as web and database servers, receive a continual stream of requests. The servers should schedule these requests to provide the best services to users. In this paper, a hybrid genetic algorithm is proposed for scheduling divisible requests without interruption in which the objective is to minimize the total stretch. The stretch of a request is the ratio of the amount of time the request spent in the system to its response time. The hybrid genetic algorithm adopts the idea of seed selection and development in order to improve the exploitation and exploration power of genetic algorithms. Extensive computational experiments have been conducted to compare the performance of the hybrid genetic algorithm with that of genetic algorithms.