On Lot-Streaming Flow Shops with Stretch Criterion

• 발행기관: 한국산업경영시스템학회
• 저자명: 윤석훈(Suk Hun Yoon)
• 간행물 정보: 『산업경영시스템학회지』제37권 제4호, 187~192쪽, 전체 5쪽
• 주제분류: 경제경영 > 경영학
• 파일형태: PDF
• 발행일자: 2014.12.31

영문 초록

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.

목차

Abstract

1. Introduction

2. Literature Review

3. Minimization of the total stretch in the n-job, m-machine Flow Shop

4. New Genetic Algorithm(NGA)

5. Computational Study

6. Conclusions

References

키워드

Scheduling Flow Shop Lot-Streaming Total Stretch Genetic Algorithms