On-line scheduling a batch processing system to minimize total weighted job completion time

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

Volumn 2223 LNCS, Issue , 2001, Pages 380-389

  Chen, Bo ^a   Deng, Xiaotie ^b   Zang, Wenan ^c  

^a CITY UNIVERSITY OF HONG KONG   (Hong Kong)

^b UNIVERSITY OF HONG KONG   (Hong Kong)

^c UNIVERSITY OF WARWICK   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

BATCH PROCESSING SYSTEM; COST CONSTRAINTS; DETERMINISTIC ALGORITHMS; FULLY POLYNOMIAL TIME APPROXIMATION SCHEMES; INTERVAL GRAPH; JOB COMPLETION; LINEAR TIME; NP-HARD; OBJECTIVE FUNCTIONS; ON-LINE ALGORITHMS; ON-LINE SETTING; ONLINE SCHEDULING; PERFORMANCE GUARANTEES; SCHEDULING PROBLEM; TOTAL WEIGHTED COMPLETION TIME; VERTEX SET;

APPROXIMATION ALGORITHMS; COMPUTATIONAL COMPLEXITY; POLYNOMIAL APPROXIMATION; TELECOMMUNICATION NETWORKS; ALGORITHMS; BATCH DATA PROCESSING; JOB SHOP SCHEDULING; SCHEDULING;

SCHEDULING ALGORITHMS;

EID: 27844461510     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45678-3_33     Document Type: Conference Paper

References (16)

1. 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 (1998), 31-54. 381
2. S. Chakrabarti, C.A. Phillips, A.S. Schulz, D.B. Shmoys, C. Stein, and J. Wein, Improved scheduling algorithms for minsum criteria. In: F. Meyer auf der Heide and B. Monien (eds.): Automata, Languages and Programming, Lecture Notes in Computer Science 1099, Springer: Berlin, 1996, 646-657. 382
3. V. Chandru, C.-Y. Lee and R. Uzsoy, Minimizing total completion time on batch processing machines, International Journal of Production Research 31 (1993), 2097-2121. 381
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 (1993), 61-65. 381
5. X. Deng, H. Feng, G. Li, G. Liu, A PTAS for minimizing total flow-time of bounded batch scheduling, unpublished manuscript. 381
6. X. Deng, H. Feng, P. Zhang, Y. Zhang, H. Zhu, Minimizing mean completion time in batch processing system, submitted for journal publication. 381
7. X. Deng and Y. Zhang, Minimizing mean response time in a batch processing system, COCOON99, Lecture Notes in Computer Science 1627 (1999), 231-240. 381
8. L.A. Hall, A.S. Schulz, D.B. Shmoys and J. Wein, Scheduling to minimize average completion time: off-line and on-line approximation algorithms, Mathematics of Operations Research 22 (1997), 513-544. 382, 383
9. R. Hassin, Approximation schemes for the restricted shortest path problem, Mathematics of Operations Research 17 ( 1992), 36-42. 387
10. D.S. Hochbaum and D. Landy, Scheduling semiconductor burn-in operations to minimize total flowtime, Operations Research 45 (1997), 874-885. 381
11. Y. Ikura and M. Gimple, Efficient scheduling algorithms for a single batch processing machine, Operations Research Letters 5 (1986), 61-65. 381
12. C.-Y. Lee and R. Uzsoy, Minimizing makespan on a single batch processing machine with dynamic job arrivals, Preprint, 1996. 381
13. C.-Y. Lee, R. Uzsoy and L.A. Martin-Vega, Efficient algorithms for scheduling semiconductor burn-in operations, Operations Research 40 (1992), 764-775. 381
14. Z. Liu and W. Yu, Scheduling one batch processor subject to job release dates, Discrete Applied Mathematics 105 (2000), 129-136. 381
15. R. Uzsoy, Scheduling batch processing machines with incompatible job families, International Journal of Production Research 33 (1995), 2685-2708. 381
16. A.P.A. Vestjens, On-Line Machine Scheduling, Ph.D. Dissertation, Department of Mathematics and Computing Science, Eindhoven University of Technology, The Netherlands, 1997. 382