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

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

Due Date Determination on the MSD Problem with a Common Due Date Window

공통의 납기 구간을 가지는 MSD 문제에서의 납기 결정

  • 한태창 ((주)테슬라시스템) ;
  • 김채복 (경북대학교 경영학부) ;
  • 이동훈 (고려대학교 공과대학 정보경영공학부)
  • Published : 2008.12.31
Download PDF
⟨ Previous Next ⟩

Abstract

JIT 생산시스템이 세계적으로 많은 회사에 적용됨에 따라 earliness와 tardiness의 페널티를 동시에 최소화하는 문제에 대한 많은 연구가 진행되어 왔다. 이 연구에서는 한정된 완료시간의 편차에 대해서는 페널티를 부과하지 않는, 즉 허용오차가 존재할 때, 공통의 납기로부터 평균제곱편차(MSD : Mean Squared Deviation)를 최소화하는 단일기계 문제를 다룬다. 허용오차가 존재하는 MSD 문제에서 최적의 공통 납기를 결정하는 방법을 개발한다. 스케줄과 허용 오차가 주어질 때, 최적의 납기를 찾는 두 개의 선형시간이 소요되는 알고리즘을 제시한다. 주어진 허용오차 중 하나는 가장 짧은 가공시간을 가지는 작업의 절반보다 작은 경우이며 다른 하나는 허용오차가 임의인 경우이다.

Keywords

References

  1. Bagchi, U., Sullivan, R. S., and Chang, Y.; "Minimizing mean squared deviation of completion times about a common due date," Management Science, 33(7) : 894-906, 1987 https://doi.org/10.1287/mnsc.33.7.894
  2. Baker, K. R., and Scudder, G. D.; "Sequencing with earliness and tardiness penalties：A Review," Operations Research, 38(1) : 22-36, 1990 https://doi.org/10.1287/opre.38.1.22
  3. Biskup, Dirk and Feldmann, Martin; "On scheduling around large restrictive common due windows," European Journal of Operational Research, 162 : 740-761, 2005 https://doi.org/10.1016/j.ejor.2003.10.026
  4. Cheng, T. C. E.; "Optimal common due-date with limited completion time deviation," Computers and Operations Research, 15(2) : 91-96, 1988 https://doi.org/10.1016/0305-0548(88)90001-9
  5. Cheng, T. C. E., and Gupta, M. C.; "Survey of scheduling research involving due date determination decisions," European Journal of Operational Research, 38 : 156-166, 1989 https://doi.org/10.1016/0377-2217(89)90100-8
  6. De, P., Ghosh, J. B., and Wells, C. E.; "On the minimization of completion time variance with a bicriteria extension," Operations Research, 40 : 1148-1155, 1992 https://doi.org/10.1287/opre.40.6.1148
  7. De, P., Ghosh, J. B., and Wells, C. E.; "On the general solution for a class of early/tardy problems," Computers and Operations Research, 20 : 141-149, 1993 https://doi.org/10.1016/0305-0548(93)90070-Y
  8. Dickman, B., Wilamowsky, Y., and Epstein, S.; "Not e：Optimal common due-date with limited completion time," Computers and Operations Research, 18(1) : 125-127, 1991 https://doi.org/10.1016/0305-0548(91)90048-V
  9. Eilon, S., and Chowdhury, I. G.; "Minimizing waiting time variance in the single machine problem," Management Science, 23 : 567-575, 1977 https://doi.org/10.1287/mnsc.23.6.567
  10. Gordon, V., Proth, J., and Chu, C.; "A survey of the state-of-art of common due date assignment and scheduling research," European Journal of Operational Research, 139 : 1-25, 2002 https://doi.org/10.1016/S0377-2217(01)00181-3
  11. Gupta, M. C., Gupta, Y. P., and Bector, C. R.; "Minimizing the flow-time variance in single-machine," Journal of Operational Society, 41(8) : 767-779, 1990 https://doi.org/10.1057/jors.1990.104
  12. Janiak, Adam, Kovalyov, M. Y., and Marek, Marcin; "Soft due window assignment and scheduling on parallel machines," IEEE Transactions on Systems, Man, and Cybernetics-Part A：Systems and Humans, 37(5) : 614-620, 2007 https://doi.org/10.1109/TSMCA.2007.893485
  13. Kahlbacher, H. G.; "SWEAT-a program for a scheduling problem with earliness and tardiness penalties," European Journal of Operational Research, 43 : 111- 112, 1989 https://doi.org/10.1016/0377-2217(89)90413-X
  14. Kanet, J. J.; "Minimizing variation of flow time in single machine systems," Management Science, 27 : 1453- 1459, 1981 https://doi.org/10.1287/mnsc.27.12.1453
  15. Kramer, F. J., and Lee, C. Y.; "Common due window scheduling," Production and Operations Management Society, 2 : 262-275, 1993
  16. Liman, S. D., and Ramaswamy, S.; "Earliness-tardiness scheduling problems with a common delivery window," Operations Research Letters, 15 : 195-203, 1994 https://doi.org/10.1016/0167-6377(94)90078-7
  17. Liman, S. D., Panwalkar, S., and Thongmee, S.; "Determination of common due date window location in a single machine scheduling problem," European Journal of Operational Research, 93 : 68-74, 1996 https://doi.org/10.1016/0377-2217(95)00181-6
  18. Merten, A. G., and Muller, M. E.; "Variance minimization in single machine sequencing problems," Management Science, 18 : 518-528, 1972 https://doi.org/10.1287/mnsc.18.9.518
  19. Schrage, L.;"Minimizing the time-in-system variance for a finite jobset," Management Science, 21 : 540-543, 1975 https://doi.org/10.1287/mnsc.21.5.540
  20. Sidney, J. B.; "Single-machine scheduling with earliness and tardiness penalties," Operations Research, 25 : 62-69, 1977 https://doi.org/10.1287/opre.25.1.62
  21. Soloman, M. M., and Desrosiers, J.; "Survey paper： Time window constrained routing and scheduling problems," Transportation Science, 22 : 1-13, 1988 https://doi.org/10.1287/trsc.22.1.1
  22. Ventura, J. A., and Weng, M, X.; "Single machine scheduling with a common delivery window," Journal of Operational Research Society, 47 : 424-434, 1996 https://doi.org/10.2307/3010584
  23. Weng, M. X. and Ventura, J. A.; "Scheduling about a large common due date with tolerance to minimize mean absolute deviation of completion times," Naval Research Logistics Quarterly, 41 : 843-851, 1994 https://doi.org/10.1002/1520-6750(199410)41:6<843::AID-NAV3220410612>3.0.CO;2-K
  24. Wilamowsky, Y., Epstein, S., and Dickman, B.; "Optimal common due-date with completion time tolerance," Computers and Operations Research, 23(12) : 1203- 1210, 1996 https://doi.org/10.1016/S0305-0548(96)00020-2
  25. Yeung, W. K., Oguz, C., and Cheng, T. C. E.; "Singlemachine scheduling with a common due window," Computers and Operations Research, 28 : 157-175, 2001 https://doi.org/10.1016/S0305-0548(99)00097-0
  26. Yeung, W. K., Oguz, C., and Cheng, T. C. E.; "Twostage flowshop earliness and tardiness machine scheduling involving a common due window," International Journal of Production Economics, 90 : 421-434, 2004 https://doi.org/10.1016/S0925-5273(03)00044-6