Journal of Korean Society of Industrial and Systems Engineering (산업경영시스템학회지)

Society of Korea Industrial and System Engineering (한국산업경영시스템학회)
권호 표지
DOI QR코드

DOI QR Code

On Lot-Streaming Flow Shops with Stretch Criterion

로트 스트리밍 흐름공정 일정계획의 스트레치 최소화

  • Yoon, Suk-Hun (Department of Industrial and Information Systems Engineering, Soongsil University)
  • 윤석훈 (숭실대학교 산업정보시스템공학과)
  • Received : 2014.11.26
  • Accepted : 2014.12.02
  • Published : 2014.12.31
Download PDF
⟨ Previous Next ⟩

Abstract

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.

Keywords

References

  1. Bender, M.A., Muthukrishnan, S., and Rajaraman, R., Approximation algorithms for average stretch scheduling. Journal of Scheduling, 2004, Vol. 7, p 195-222. https://doi.org/10.1023/B:JOSH.0000019681.52701.8b
  2. Buscher, U. and Shen, L., An integrated Tabu search algorithm for the lot streaming problem in job-shops. European Journal of Operational Research, 2009, Vol. 199, No. 1, p 385-399.
  3. Chan, W.-T., Lan, T.-W., Liu, K.-S., and Wong, P.W.H. New resource augmentation analysis of the total stretch of SRPT and SJF in multiprocessor scheduling. Theoretical Computer Science, 2006, Vol. 359, p 430-439. https://doi.org/10.1016/j.tcs.2006.06.003
  4. Chang, J.H. and Chiu, H.N., A comprehensive review of lot streaming. International Journal of Production Research, 2005, Vol. 43, No. 8, p 1515-1536. https://doi.org/10.1080/00207540412331325396
  5. Cheng, M., Mukherjee, H.J., and Sarin, S.C., A review of lot streaming. International Journal of Production Research, 2013, Vol. 51, No. 23-24, p 7023-7046. https://doi.org/10.1080/00207543.2013.774506
  6. Defersha, F.M. and Chen, M., Jobshop lot streaming with routing flexibility, sequence-dependent setups, machine release dates and lag time. International Journal of Production Research, 2012, Vol. 8, No. 15, p 2331- 2352.
  7. Dreo, J., Petrowski, A., Siarry, P., and Taillard, E., Metaheuristics for Hard Optimization : Methods and Case Studies. New York, Springer, 2005.
  8. Goldberg, D.E. Genetic algorithms in search, optimization, and machine learning. New York, Addison-Wesley, 1989.
  9. Hall, N.G., Laporte, G., Selvarajah, E., and Sriskandrajah, C., Scheduling and lot streaming in two-machine open shops with no-wait in process. Naval Research Logistics, 2005, Vol. 52, p 261-275. https://doi.org/10.1002/nav.20065
  10. Kalir, A.A. and Sarin, S.C., Evaluation of the potential benefits of lot streaming in flow-shop systems. International Journal of Production Economics, 2000, Vol. 66, No. 2, p 131-142. https://doi.org/10.1016/S0925-5273(99)00115-2
  11. Liepins, G.E. and Hilliard, M.R., Genetic algorithms : Foundation and applications. Annals of Operations Research, 1989, Vol. 21, No. 1-4, p 31-58. https://doi.org/10.1007/BF02022092
  12. Low, C., Hsu, C.-M., and Huang, K.-I., Benefits of lot splitting in job-shop scheduling. International Journal of Advanced Manufacturing Technology, 2004, Vol. 24, p 773-780.
  13. Marimuthu, S., Ponnambalam, S.G., and Jawahar, N., Evolutionary algorithms for scheduling m-machine flow shop with lot streaming. Robotics and Computer-Integrated Manufacturing, 2008, Vol. 24, No. 1, p 125-139. https://doi.org/10.1016/j.rcim.2006.06.007
  14. Muthukrishnan, S., Rajaraman, R., Shaheen, A., and Gehrke, J.F., Online scheduling to minimize average stretch. Siam Journal on Computing, 2005, Vol. 34, No. 2, p 433-452. https://doi.org/10.1137/S0097539701387544
  15. Pan, Q.-K., Tasgetiren, M.F., Suganthan, P.N., and Chua T.J., A discrete artificial bee colony algorithm for the lot-streaming flow shop scheduling problem. Information Sciences, 2011, Vol. 183, p 2455-2468.
  16. Pinedo, M.L., Scheduling : Theory, Algorithms, and Systems (4th Ed.). New York, Springer, 2012.
  17. Tseng, C.-T. and Liao, C.-J., A discrete particle swarm optimization for lot-streaming flow-shop scheduling problem. European Journal of Operational Research, 2008, Vol. 191, No. 1, p 360-373. https://doi.org/10.1016/j.ejor.2007.08.030
  18. Zhang, W., Yin, C., Liu, J., and Linn, R.J., Multi-job lot streaming to minimize the mean completion time in m-1 hybrid flowshops. International Journal of Production Economics, 2005, Vol. 96, p 189-200. https://doi.org/10.1016/j.ijpe.2004.04.005

Cited by

  1. AREA 활용 전력수요 단기 예측 vol.39, pp.1, 2014, https://doi.org/10.11627/jkise.2016.39.1.025