Semi-online machine covering

Asia-Pacific Journal of Operational Research

Volumn 24, Issue 3, 2007, Pages 373-382

  Cai, Sheng Yi ^a  

^a WENZHOU UNIVERSITY   (China)

Author keywords

Analysis of algorithm; Competitive ratio; Machine covering; Scheduling; Semi online

Indexed keywords

PARALLEL ALGORITHMS; PROBLEM SOLVING; SCHEDULING; SET THEORY;

ALGORITHM ANALYSIS; COMPETITIVE RATIO; MACHINE COVERING; SEMI-ONLINE;

ONLINE SYSTEMS;

EID: 34547172255     PISSN: 02175959     EISSN: None     Source Type: Journal    
DOI: 10.1142/S0217595907001255     Document Type: Article

References (18)

1. Azar, Y and L Epstein (1997). On-line machine covering. In Algorithms-ESA'97, Lecture Notes in Computer Science, Vol. 1284, pp. 23-36. Springer Verlag.
2. Csirik, J, H Kellerer and G. Woeginger (1992). The exact LPT-bound for maximizing the minimum completion time. Oper. Res. Letters, 11, 281-287.
3. Deuermeyer, BL and DK Friesen (1981). Analysis of greedy solutions for a replacement part sequencing problem. Math. Oper. Rea., 6, 74-87.
4. Deuermeyer, BL, DK Friesen and MA Langston (1982). Scheduling to maximize the minimum processing finish time in a multiprocessor system. SIAM J. Algebraic Discrete Metheds, 3, 190-196.
5. Ebenlendr, T, J Noga, J Sgall and G Woeginger (2005). A note on semi-online machine covering. In: The 3rd Workshop on Approximation and Online Algorithms, Lecture Notes in Computer Science.
6. Epstein, L and LM Favrholdt (2002a). Optimal non-preemptive semi-on-line scheduling on two related machines. In: Proceedings of the 27th International Symposium on Mathematical Foundations of Computer Science (MFCS'2002), pp. 245-256.
7. Epstein, L and LM Favrholdt (2002b). Optimal preemptive semi-on-line scheduling to minimize makespan on two related machines. Oper. Res. Letters, 30(4), 269-275.
8. He, Y (2000). The optimal on-line parallel machine scheduling. Computers and Mathematics with Applications, 17(1), 107-113.
9. He, Y (2001). Semi-on-line scheduling problems for maximizing the minimum machine completion time. Acta Mathematicae Applicatae Sinica, 17(1), 107-113.
10. He, Y and SY Cai (2002). Semi online Scheduling with machine cost. Journal of Computer Science and Technology, 39, 117-121.
11. He, Y and ZY Tan (2002). Ordinal on-line scheduling for maximizing the minimum machine completion time. Journal of Combinatorial Optimization, 6, 199-206.
12. He, Y and ZY Tan (2003). Randomized on-line and semi-on-line scheduling on identical machines. Asia-Pacific Journal of Operational Research, 20, 31-40.
13. He, Y and GC Zhang (1999). Semi online scheduling on two identical machines. Computing, 62, 179-187.
14. Kellerer, H, V Kotov, M Speranza and Z Tuza (1997). Semi online algorithms for the partition problem. Oper. Res. Letters, 21, 235-242.
15. Seiden, S, J Sgall and G Woeginger (2000). Semi-online scheduling with decreasing job sizes. Oper. Res. Letters, 27, 215-221.
16. Tan, ZY and Y He (2001) Semi online scheduling with ordinal data on two uniform machines. Oper. Res. Letters, 28(5), 221-231.
17. Woeginger, G (1999). A polynomial-time approximation scheme for maximizing the minimum machine completion time. Oper. Res. Letters, 20, 149-154.
18. max with a buffer. Information Progressing Letters, 61, 145-148.