Journal of the Korea Safety Management & Science (대한안전경영과학회지)

Korea Safety Management & Science (대한안전경영과학회)
권호 표지

A Batch Processing Problem for Jobs with Variable Processing Sneed

처리속도가 가변적인 작업들의 일괄처리 일정 계획 문제

  • 오세호 (청주대학교 이공대학 산업공학과) ;
  • 이근부 (청주대학교 이공대학 산업공학과)
  • Published : 2006.08.30
Download PDF
⟨ Previous Next ⟩

Abstract

This paper deals with a batch processor model in which the batch processing speed depends on the jobs assigned to the batch. Each job is completed by accomplishing its required job processing quantity which is calculated as job speed product processing time. Its speed is given as not the exact value but the range. Thus the batch sets are constructed by the jobs which hold the speed in common. And the batch sets are processed as soon as possible. We developed the model to described the problem situation and adopt the total tardiness as the decision criterion.

Keywords

References

  1. Ahmed, I., and W.W. Fisher, "Due Date Assignment, Job Order Release and Sequencing," Decision Sciences, 23, 1992, pp.633-644 https://doi.org/10.1111/j.1540-5915.1992.tb00409.x
  2. K. R. Baker, Elements of Sequencing and Scheduling, Amos Tuck School of Business Administration, Dartmouth College, Hanover., 1998
  3. V. Chandru, C.Y. Lee and R. Uzsoy, "Minimizing Total Completion Time on Batch Processing Machine," International Journal of Production Research 31, 1993, pp.2097-2122 https://doi.org/10.1080/00207549308956847
  4. T.C.E. Cheng, Q. Ding and B.M.T. Lin, "A concise survey of scheduling with time-dependent processing times," European Journal of Operational Research, 152. 2004, pp.1-13 https://doi.org/10.1016/S0377-2217(02)00909-8
  5. T.C.E. Cheng, Y. He, H. Hoogeveen, Min Ji and G. J. Woeginger,"Scheduling with step-improving processing times," Operations Research Letters, 34, 2006, pp.37-40 https://doi.org/10.1016/j.orl.2005.03.002
  6. G. R. Dobson and R. S. Nambimadom, "The Batch Loading and Scheduling Problem," Oper. Res., 49, 2001, pp.52-65 https://doi.org/10.1287/opre.49.1.52.11189
  7. D. S. Hochbaum and D. Landy, "Scheduling semiconductor burn-in operations to minimize total flowtime," Oper. Res., 45, 1997, pp.874-885 https://doi.org/10.1287/opre.45.6.874
  8. C. Y. Lee, R. Uzsoy and L. A. Martin-Vega, "Efficient algorithms for scheduling semiconductor burn-in operations," Oper. Res., 40, 1992, pp.764-775 https://doi.org/10.1287/opre.40.4.764
  9. S. Webster and K. R. Baker, "Scheduling groups of jobs on a single machine", Oper. Res., 43, 1995, pp.692-703 https://doi.org/10.1287/opre.43.4.692