한국시뮬레이션학회논문지 (Journal of the Korea Society for Simulation)

한국시뮬레이션학회 (The Korea Society for Simulation)
권호 표지
DOI QR코드

DOI QR Code

작업별 위치기반 지수학습 효과를 갖는 2-에이전트 스케줄링 문제를 위한 시뮬레이티드 어닐링

Simulated Annealing for Two-Agent Scheduling Problem with Exponential Job-Dependent Position-Based Learning Effects

  • 투고 : 2015.08.28
  • 심사 : 2015.12.10
  • 발행 : 2015.12.31
PDF 다운로드
⟨ 이전 논문 다음 논문 ⟩

초록

본 논문은 작업별 위치기반 지수학습 효과를 갖는 2-에이전트 단일기계 스케줄링 문제를 고려한다. 에이전트 A는 가중 완료 시간의 합을 최소화하며, 에이전트 B는 총소요시간에 대한 상한 값을 만족하는 조건을 갖는다. 본 연구에서는 먼저 우수해/가능해에 대한 특성을 개발하고, 이를 이용하여 최적 해를 찾기 위한 분지한계 알고리즘을 설계한다. 또한 근사 최적 해를 구하기 위해 6가지 다른 초기해 생성 방법을 이용한 시뮬레이티드 어닐링 알고리즘을 제안한다. 수치 실험을 통해 제안된 알고리즘의 우수한 성능을 검증한다. 실험 결과, 다른 초기해 생성 방법들 간에는 %errors 차이가 유의하게 발생하지 않았으며, 에이전트 A의 작업 순서를 무작위로 생성할 때 성능이 좋아짐을 발견하였다. 반면에, 에이전트 B의 초기해 생성 방법은 성능에 영향을 미치지 않았다.

In this paper, we consider a two-agent single-machine scheduling problem with exponential job-dependent position-based learning effects. The objective is to minimize the total weighted completion time of one agent with the restriction that the makespan of the other agent cannot exceed an upper bound. First, we propose a branch-and-bound algorithm by developing some dominance /feasibility properties and a lower bound to find an optimal solution. Second, we design an efficient simulated annealing (SA) algorithm to search a near optimal solution by considering six different SAs to generate initial solutions. We show the performance superiority of the suggested SA using a numerical experiment. Specifically, we verify that there is no significant difference in the performance of %errors between different considered SAs using the paired t-test. Furthermore, we testify that random generation method is better than the others for agent A, whereas the initial solution method for agent B did not affect the performance of %errors.

키워드

참고문헌

  1. Agnetis, A. (2012), "Multiagent scheduling problems", Tutorials in Operations Research, Informs 2012, pp. 151-170.
  2. Agnetis, A., Mirchandani, P.B., Pacciarelli, D., and Pacifici, A. (2004), "Scheduling problems with two competing agents", Operations Research, 52(2), pp. 229-242. https://doi.org/10.1287/opre.1030.0092
  3. Bachman, A. and Janiak, A. (2004), "Scheduling jobs with position-dependent processing times", Journal of the Operational Research Society, 55, pp. 257-264. https://doi.org/10.1057/palgrave.jors.2601689
  4. Baker, K.R. and Smith, J.C. (2003), "A multiple-criterion model for machine scheduling", Journal of Scheduling, 6, pp. 7-16. https://doi.org/10.1023/A:1022231419049
  5. Biskup D. (1999), "Single-machine scheduling with learning considerations", European Journal of Operational Research, 115, pp. 173-178. https://doi.org/10.1016/S0377-2217(98)00246-X
  6. Biskup, D. (2008), "A state-of-the-art review on scheduling with learning considerations", European Journal of Operational Research, 188(2), pp. 315-329. https://doi.org/10.1016/j.ejor.2007.05.040
  7. Chang, P.C., Chen, S.H., and Mani, V. (2009), "A note on due-date assignment and single machine scheduling with a learning/aging effect", International Journal of Production Economics, 117, pp. 142-149. https://doi.org/10.1016/j.ijpe.2008.10.004
  8. Cheng, T.C.E. and Wang, G. (2000), "Single machine scheduling with learning effect considerations", Annals of Operations Research, 98, pp. 273-290. https://doi.org/10.1023/A:1019216726076
  9. Cheng, T.C.E., Wu, W.H., Cheng, S.R., and Wu, C.C. (2011), "Two-agent scheduling with position-based deterioration jobs and learning effects", Applied Mathematics and Computation, 217, pp. 8804-8824. https://doi.org/10.1016/j.amc.2011.04.005
  10. Choi, J.Y. (2015), "An efficient simulated annealing for two-agent scheduling with exponential job-dependent position-based learning consideration", In the proceeding of the MISTA 2015 Conference, Prague, Czech Republic.
  11. Graham, R.L., Lawler, E.L., Lenstra, J.K., and Rinnooy, Kan AHG. (1979), "Optimization and approximation in deterministic sequencing and scheduling theory: a survey", Annals of Discrete Mathematics, 5, pp. 287-326. https://doi.org/10.1016/S0167-5060(08)70356-X
  12. Hardy, G., Littlewood, J., and Polya, G., Inequalities. London: Cambridge University Press, 1967.
  13. Hayter, A. J., Probability and Statistics, International Thomson PUB, 1996.
  14. Hillier, F.S. and Lieberman, G.J., Introduction to Operations Research, McGraw Hill, 2015.
  15. Kirkpatrick, S., Gelatt, C., and Vecchi, M. (1983). "Optimization by simulated annealing", Science, 220, pp. 671-680. https://doi.org/10.1126/science.220.4598.671
  16. Kuo, W.H. and Yang, D.L. (2008), "Minimizing the makespan in a single-machine scheduling problem with the cyclic process of an aging effect", Journal of the Operational Research Society, 59, pp. 416-420. https://doi.org/10.1057/palgrave.jors.2602363
  17. Lee, W.C., Wang, W.J, Shiau, Y.R., and Wu, C.C. (2010), "A single-machine scheduling problem with two-agent and deteriorating jobs", Applied Mathematical Modelling, 34, pp. 3098-3107. https://doi.org/10.1016/j.apm.2010.01.015
  18. Li, D.C. and Hsu, P.H. (2012), "Solving a two-agent single-machine scheduling problem considering learning effect", Computers & Operations Research, 39, pp. 1644-1651. https://doi.org/10.1016/j.cor.2011.09.018
  19. Liu, P., Zhou, X., and Tang, L. (2010), "Two-agent single-machine scheduling with position-dependent processing times", International Journal of Advanced Manufacturing Technology, 48, pp. 325-331. https://doi.org/10.1007/s00170-009-2259-5
  20. Liu, P., Yi, N., and Zhou, X. (2011), "Two-agent single-machine scheduling problems under increasing linear deterioration", Applied Mathematical Modelling, 35, pp. 2290-2296. https://doi.org/10.1016/j.apm.2010.11.026
  21. Mosheiov, G. (2001), "Parallel machine scheduling with a learning effect", Journal of the Operational Research Society, 52, pp. 1165-1169. https://doi.org/10.1057/palgrave.jors.2601215
  22. Mosheiov, G. (2005), "A note on scheduling deteriorating jobs", Mathematical and Computer Modelling, 41, pp. 883-886. https://doi.org/10.1016/j.mcm.2004.09.004
  23. Moshiov, G. and Sidney, J. B. (2003), "Scheduling with general job-dependent learning curves", European Journal of Operational Research, 147, pp. 665-670. https://doi.org/10.1016/S0377-2217(02)00358-2
  24. Wang, J.B. and Xia, Z.Q. (2005), "Flow-shop scheduling with a learning effect", Journal of the Operational Research Society, 56, pp. 1325-1330. https://doi.org/10.1057/palgrave.jors.2601856
  25. Wu, C.C., Huang, S.K., and Lee, W.C. (2011), "Two-agent scheduling with learning consideration", Computers & Industrial Engineering, 61, pp. 1324-1335. https://doi.org/10.1016/j.cie.2011.08.007
  26. Wu, W.H., Xu, J., Wu, W.H., Yin, Y., Cheng, I.F., and Wu, C.C. (2013), "A tabu method for a two-agent single-machine scheduling with deterioration jobs", Computers & Operations Research, 40, pp. 2116-2127. https://doi.org/10.1016/j.cor.2013.02.025