한국전자거래학회지 (The Journal of Society for e-Business Studies)

  • 제20권1호
  • /
  • Pages.79-88
  • /
  • 2015
  • /
  • 2288-3908(pISSN)
  • /
  • 2765-3846(eISSN)
한국전자거래학회 (Society for e-Business Studies)
권호 표지
DOI QR코드

DOI QR Code

총 스트레치 최소화를 위한 분할 가능 리퀘스트 흐름 스케줄링

Minimizing the Total Stretch when Scheduling Flows of Divisible Requests without Interruption

  • Yoon, Suk-Hun (Department of Industrial and Information Systems Engineering, Soongsil University)
  • 투고 : 2014.11.28
  • 심사 : 2014.12.30
  • 발행 : 2015.02.28
PDF 다운로드
⟨ 이전 논문 다음 논문 ⟩

초록

웹 서버나 데이터베이스 서버와 같은 컴퓨터 서버들은 연속적으로 리퀘스트 스트림을 받는다. 이런 서버들은 유저들에게 최선의 서비스를 제공하기 위해 리퀘스트들을 스케줄링하여야 한다. 이 논문은 분할 가능 리퀘스트들을 스케줄링할 때 총 스트레치를 최소화하기 위해 혼합 유전자 알고리즘을 제안한다. 리퀘스트의 스트레치는 리퀘스트가 시스템에 머무는 시간에 대한 반응 시간의 비율로 정의된다. 혼합 유전자 알고리즘은 유전자 알고리즘의 활용과 탐구 능력를 개선하기 위해 시드 선택과 개발의 아이디어를 도입하였다. 혼합 유전자 알고리즘과 유전자 알고리즘의 성능을 비교하기 위하여 광범한 컴퓨터 실험이 실행되었다.

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.

키워드

참고문헌

  1. Bender, M. A., Muthukrishnan, S., and Rajaraman, R., "Approximation algorithms for average stretch scheduling," Journal of Scheduling, Vol. 7, pp. 195-222, 2004. https://doi.org/10.1023/B:JOSH.0000019681.52701.8b
  2. Bhattacharyya, S., "Direct marketing performance modeling using genetic algorithms," INFORMS Journal on Computing, Vol. 11, pp. 248-257, 1999. https://doi.org/10.1287/ijoc.11.3.248
  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, Vol. 359, pp. 430-439, 2006. 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, Vol. 43, No. 8, pp. 1515-1536, 2005. 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, Vol. 51, No. 23-24, pp. 7023-7046, 2013. https://doi.org/10.1080/00207543.2013.774506
  6. Chiu, H.-N., Chang, J.-H., and Lee, C.-H., "Lot streaming models with a limited number of capacitated transporters in multistage batch production system," Computers and Operations Research, Vol. 31, pp. 2003-2020, 2004. https://doi.org/10.1016/S0305-0548(03)00159-X
  7. Dreo, J., Petrowski, A., Siarry, P., and Taillard, E., Metaheuristics for Hard Optimization : Methods and Case Studies. Springer, New York, 2005.
  8. Edis, R. S. and Ornek, M. A., "A tabu search-based heuristic for single-product lot streaming problems in flow shops," International Journal of Advanced Manufacturing Technology, Vol. 43, pp. 1202-1213, 2009. https://doi.org/10.1007/s00170-008-1798-5
  9. Feldmannn, M. and Biskup, D., "Lot streaming in a multiple product permutation flow shop with intermingling," International Journal of Production Research, Vol. 46, No. 1, pp. 197-216, 2008. https://doi.org/10.1080/00207540600930065
  10. Goldberg, D. E., Genetic algorithms in search, optimization, and machine learning, Addison-Wesley, New York, 1989.
  11. Liepins, G. E. and Hilliard, M. R., "Genetic algorithms : Foundation and applications," Annals of Operations Research, Vol. 21, No. 1-4, pp. 31-58, 1989. https://doi.org/10.1007/BF02022092
  12. Muthukrishnan, S., Rajaraman, R., Shaheen, A., and Gehrke, J. F., "Online scheduling to minimize average stretch," Siam Journal on Computing, Vol. 34, No. 2, pp. 433-452, 2005. https://doi.org/10.1137/S0097539701387544
  13. Pan, Q.-K., Suganthan, P. N., Liang, J. J., and Tasgetiren, M. F., "A local-best harmony search algorithm with dynamic sub-harmony memories for lot-streaming lfow shop scheduling problem," Expert Systems with Applications, Vol. 38, pp. 3252-3259, 2011. https://doi.org/10.1016/j.eswa.2010.08.111
  14. Pinedo, M. L., Scheduling : Theory, Algorithms, and Systems(4th Ed.), Springer, New York, 2012.
  15. Song, B. D. and Oh, Y., "A study on network redesign for supply chain expansion," The Journal of Society for e-Business Studies, Vol. 17, No. 4, pp. 141-153, 2012. https://doi.org/10.7838/jsebs.2012.17.4.141
  16. Wong, T. C., Chan, F. T. S., and Chan, L. Y., "A resource-constrained assembly job shop scheduling problem with lot streaming technique," Computers and Industrial Engineering, Vol. 57, 983-995, 2009. https://doi.org/10.1016/j.cie.2009.04.002

피인용 문헌

  1. 작업별 중요도 모드를 적용한 혼합 중요도 스케줄링에서 확률적 성능 평가 기법 vol.23, pp.3, 2015, https://doi.org/10.7838/jsebs.2018.23.3.001
  2. Lot Streaming in Different Types of Production Processes: A PRISMA Systematic Review vol.5, pp.4, 2015, https://doi.org/10.3390/designs5040067