The Buffer Minimization Problem for Multiprocessor Scheduling with Conflicts-Reference-Cited by-同舟云学术

The Buffer Minimization Problem for Multiprocessor Scheduling with Conflicts

Published:2001 Issue: Volume: Page:862-874
ISSN:0302-9743
Container-title:Automata, Languages and Programming
language:
Short-container-title:

Author:

Chrobak Marek,Csirik János,Imreh Csanád,Noga John,Sgall Jiří,Woeginger Gerhard J.

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/3-540-48224-5_70

Reference9 articles.

1. M. Grőtschel, L. Lovász, AND A. Schrijver [1981]. The ellipsoid method and its consequences in combinatorial optimization. Combinatorica 1, 169–197.

2. S. Irani AND V. Leung [1997]. Probabilistic analysis for scheduling with conflicts, Proceedings of the 8th Annual ACM-SIAM Symposium on Discrete Algorithms, 286–295.

3. S. Irani AND V. Leung [1996]. Scheduling with conflicts, and applications to traffic signal control, Proceedings of the 7th Annual ACM-SIAM Symposium on Discrete Algorithms, 85–94.

4. A. Bar-Noy, M. Bellare, M.M. Halldórsson, H. Shachnai AND T. Tamir [1998]. On chromatic sums and distributed resource allocation. Information and Computation 140, 183–202.

5. A. Bar-Noy AND G. Kortsarz [1998]. Minimum color sum of bipartite graphs, Journal of Algorithms 28, 339–365.

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

1. Scheduling with Machine Conflicts;Approximation and Online Algorithms;2022

2. How asymmetry helps buffer management: achieving optimal tail size in cup games;Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing;2021-06-15

3. Buffer Minimization with Conflicts on a Line;Frontiers in Algorithmics;2020

4. Priority Scheduling in the Bamboo Garden Trimming Problem;SOFSEM 2019: Theory and Practice of Computer Science;2019

5. Optimised scheduling in human–robot collaboration – a use case in the assembly of printed circuit boards;International Journal of Production Research;2018-08-09