비정체 로트 - 스트리밍 흐름공정 일정계획

No-Wait Lot-Streaming Flow Shop Scheduling

  • 윤석훈 (숭실대학교 산업정보시스템공학과)
  • Yoon, Suk-Hun (Department of Industrial and Information Systems Engineering, Soongsil University)
  • 투고 : 20040500
  • 심사 : 20040500
  • 발행 : 2004.06.30

초록

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.

키워드

참고문헌

  1. Benjaafar, S. (1996), On production batches, transfer batches, and lead times, IIE Transactions, 28,357-362
  2. Gershwin, S.B. (1994), Manufacturing Systems Engineering, Prentice Hall, New Jersey
  3. Goldberg, D.E. (1989), Genetic Algorithms in Search, Optimization, and Machine Learning, Addison-Wesley Publishing Company, New York, NY
  4. Graves, S.c. and Kostreva, M.M. (1986), Overlapping operations in material requirements planning, Journal of Operations Management, 6, 283-294
  5. Jacobs, F.R. and Bragg, DJ. (1988), Repetitive lots: Flow-time reductions through sequencing and dynamic batch sizing, Decision Sciences, 19, 281-294
  6. Pinedo, M. (2002), Scheduling: Theory, Algorithms, and Systems (2nd Ed.), Prentice Hall, Upper Saddle River, New Jersey
  7. Potts, C.N. and Van Wassenhove, L.N. (1992), Integrating scheduling with batching and lot-sizing: a review of algorithms and complexity, Journal of the Operational Research Society, 43, 395-406
  8. Reeves, C.R (1993), Modern Heuristic Techniques for Combinatorial Problems (Ed.), Halsted Press, New York
  9. Reeves, C.R (1995), A genetic algorithm for flowshop sequencing, Computers and Operations Research, 22(1), 5-13
  10. Sriskand Arajah, C and Wagneur, E. (1999), Lot streaming and scheduling multiple products in two-machine no-wait flowshops, IIE Transactions, 31, 695-707