Detailed Information
Cited 0 time in 
Cited 0 time in 
Cited 0 time in
Metadata Downloads
딜리버리 윈도우 로트-스트리밍 흐름 공정 문제Lot-Streaming Flow Shop Problem with Delivery Windows
- Other Titles
- Lot-Streaming Flow Shop Problem with Delivery Windows
- Authors
- 윤석훈
- Issue Date
- Jun-2004
- Publisher
- 대한산업공학회
- Keywords
- scheduling; flow shop; lot-streaming; mean weighted absolute deviation; genetic algorithms
- Citation
- 대한산업공학회지, v.30, no.2, pp.8 - 8
- Journal Title
- 대한산업공학회지
- Volume
- 30
- Number
- 2
- Start Page
- 8
- End Page
- 8
- ISSN
- 1225-0988
- Abstract
- 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. A new genetic algorithm (NGA) is proposed for a n-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.
- Files in This Item
- Go to Link
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.