Approximation algorithms in batch processing

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1741, Issue , 1999, Pages 153-162

  Deng, Xiaotie ^a   Poon, Chung Keung ^a   Zhang, Yuzhong ^b  

^a CITY UNIVERSITY OF HONG KONG   (Hong Kong)

^b QUFU NORMAL UNIVERSITY   (China)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; BATCH DATA PROCESSING; POLYNOMIAL APPROXIMATION; POLYNOMIALS;

BATCH PROCESSING MACHINE; COMPETITIVE RATIO; FIXED NUMBERS; FULLY POLYNOMIAL TIME APPROXIMATION SCHEMES; MINIMUM MAKESPAN; ON-LINE SETTING; POLYNOMIAL TIME APPROXIMATION SCHEMES; PROCESSING TIME;

APPROXIMATION ALGORITHMS;

EID: 84958056049     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-46632-0_16     Document Type: Conference Paper

References (13)

1. J.H. Ahmadi, R.H. Ahmadi, S. Dasu, and C.S. Tang. Batching and scheduling jobs on batch and discrete processors. Operations Research, 40:750-763, 1992.
2. J.J. Bartholdi. unpublished manuscript, 1988.
3. P. Brucker, A. Gladky, H. Hoogeveen, M.Y. Kovalyov, C.N. Potts, T. Tautenhahn, and S.L. van de Velde. Scheduling a batching machine. Journal of Scheduling, 1:31-54, 1998.
4. V. Chandru, C.Y. Lee, and R. Uzsoy. Minimizing total completion time on a batch processing machine with job families. Operations Research Letters, 13:61-65, 1993.
5. V. Chandru, C.Y. Lee, and R. Uzsoy. Minimizing total completion time on batch processing machines. International Journal of Production Research, 31:2097-2121, 1993.
6. G. Dobson and R.S. Nambinadom. The batch loading scheduling problem. Technical report, Simon Graduate School of Business Administration, University of Rochester, 1992.
7. C.R. Glassey and W.W. Weng. Dynamic batching heuristics for simultaneous processing. IEEE Transactions on Semiconductor Manufacturing, pages 77-82, 1991.
8. R.L. Graham, Lawler, J.K. Lenstra, and A.H.G. Rinnooy Kan. Optimization and approximation in deterministic sequencing and scheduling. Annals of Discrete Mathematics, 5:387-326, 1979.
9. Y. Ikura and M. Gimple. Scheduling algorithm for a single batch processing machine. Operations Research Letters, 5:61-65, 1986.
10. C.Y. Lee and R. Uzsoy. Minimizing makespan on a single batch processing machine with dynamic job arrivals. Technical report, Department of Industrial and System Engineering, University of Florida, January 1996.
11. C.Y. Lee, R. Uzsoy, and L.A. Martin Vega. Efficient algorithms for scheduling semiconductor burn-in operations. Operations Research, 40:764-775, 1992.
12. C.L. Li and C.Y. Lee. Scheduling with agreeable release times and due dates on a batch processing machine. European Journal of Operational Research, 96:564-569, 1997.
13. R. Uzsoy. Scheduling batch processing machines with incompatible job families. International Journal of Production Research, pages 2605-2708, 1995.