Semi-on-line multiprocessor scheduling with given total processing time-Reference-Cited by-同舟云学术

Semi-on-line multiprocessor scheduling with given total processing time

Published:2005-06 Issue:1-3 Volume:337 Page:134-146
ISSN:0304-3975
Container-title:Theoretical Computer Science
language:en
Short-container-title:Theoretical Computer Science

Author:

Cheng T.C. Edwin,Kellerer Hans,Kotov Vladimir

Publisher

Elsevier BV

Subject

General Computer Science,Theoretical Computer Science

Reference9 articles.

1. On-line bin-stretching;Azar;Theoret. Comput. Sci.,2001

2. Bin stretching revisited;Epstein;Acta Inform.,2003

3. On the performance of on-line algorithms for partition problems;Faigle;Acta Cybernet.,1989

4. On-line scheduling revisited;Fleischer;J. Schedul.,2000

5. T. Gormley, N. Reingold, E. Torng, J. Westbrook, Generating adversaries for request-answer games, in: Proc. 11th ACM-SIAM Symp. on Discrete Algorithms (SODA’00), 2000, pp. 564–565.

Cited by 36 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Bin stretching with migration on two hierarchical machines;Mathematical Methods of Operations Research;2023-07-19

2. Semi-Online Scheduling on Two Identical Parallel Machines with Initial-Lookahead Information;Asia-Pacific Journal of Operational Research;2023-03-31

3. Semi-Online Multi-Machine with Restart Scheduling for Integrated Edge and Cloud Computing Systems;Proceedings of the 51st International Conference on Parallel Processing;2022-08-29

4. Competitive analysis of online machine rental and online parallel machine scheduling problems with workload fence;Journal of Combinatorial Optimization;2022-06-30

5. Semi-online scheduling: A survey;Computers & Operations Research;2022-03