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

  • 제28권1호
  • /
  • Pages.92-96
  • /
  • 2005
  • /
  • 2005-0461(pISSN)
  • /
  • 2287-7975(eISSN)
한국산업경영시스템학회 (Society of Korea Industrial and System Engineering)
권호 표지

동적 도착의 총 납기 지연 최소화 문제

A Batching Problem to minimize the total Tardiness with Dynamic Arrivals

  • 오세호 (청주대학교 산업정보시스템공학과) ;
  • 이근부 (청주대학교 산업정보시스템공학과) ;
  • 양희중 (청주대학교 산업정보시스템공학과)
  • Oh Se-Ho (Department of Industrial & Information Systems Engineering, Chongju University) ;
  • Lee Keun-Boo (Department of Industrial & Information Systems Engineering, Chongju University) ;
  • Yang Hee-Joon (Department of Industrial & Information Systems Engineering, Chongju University)
  • 발행 : 2005.03.01
PDF 다운로드
⟨ 이전 논문 다음 논문 ⟩

초록

This paper deals with a batch processor model in which the batch processing times depend on the jobs assigned to the batch. Each job has a distinct processing time which is determined as not the exact value but the range from the lower limit to the upper, which makes it possible to group several jobs into the same batch. In point of this flexibility our model can be referred to as the generalization of the bum-in model in which the upper limit of each job is unbounded. The jobs to be scheduled may be available nonsimultaneously. Therefore they have different ready times. We develop the model to describe the problem situation and the heuristic methods to minimize the total tardiness. And our batching rule is compared with other dispatching ones.

키워드

참고문헌

  1. 오세호, '구간 공정 시간을 갖는 작업들의 일괄처리 일정계획문제', 산업경영시스템학회지, 제27권, 제1호, pp,47-50, 2004
  2. Ahmed, I., and W.W. Fisher, 'Due Date Assignment, Job Order Release and Sequencing,' Decision Sciences, 23, pp.633-644, 1992 https://doi.org/10.1111/j.1540-5915.1992.tb00409.x
  3. K. R. Baker, Elements of Sequencing and Scheduling, Amos Tuck School of Business Administration, Dartmouth College, Hanover., 1998
  4. V. Chandru, C.Y. Lee and R. Uzsoy, 'Minimizing Total Completion Time on Batch Processing Machine,' International Journal of Production Research 31, pp.2097-2122, 1993 https://doi.org/10.1080/00207549308956847
  5. G. R. Dobson and R. S. Nambimadom, 'The Batch Loading and Scheduling Problem,' Oper. Res., 49, pp.52-65, 2001 https://doi.org/10.1287/opre.49.1.52.11189
  6. D. S. Hochbaum and D. Landy, 'Scheduling semi­conductor burn-in operations to minimize total flow­time,' Oper. Res., 45, pp.874-885, 1997 https://doi.org/10.1287/opre.45.6.874
  7. C. Y. Lee, R. Uzsoy and L. A. Martin-Vega, 'Efficient algorithms for scheduling semiconductor bum-in oper­ations,' Oper. Res., 40, pp.764-775, 1992 https://doi.org/10.1287/opre.40.4.764