Browse > Article

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)
Publication Information
Journal of Korean Society of Industrial and Systems Engineering / v.28, no.1, 2005 , pp. 92-96 More about this Journal
Abstract
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.
Keywords
Citations & Related Records
연도 인용수 순위
  • Reference
1 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   DOI   ScienceOn
2 Ahmed, I., and W.W. Fisher, 'Due Date Assignment, Job Order Release and Sequencing,' Decision Sciences, 23, pp.633-644, 1992   DOI
3 G. R. Dobson and R. S. Nambimadom, 'The Batch Loading and Scheduling Problem,' Oper. Res., 49, pp.52-65, 2001   DOI   ScienceOn
4 K. R. Baker, Elements of Sequencing and Scheduling, Amos Tuck School of Business Administration, Dartmouth College, Hanover., 1998
5 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   DOI   ScienceOn
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   DOI   ScienceOn
7 오세호, '구간 공정 시간을 갖는 작업들의 일괄처리 일정계획문제', 산업경영시스템학회지, 제27권, 제1호, pp,47-50, 2004