ACM Home Page
Please provide us with feedback. Feedback
Scheduling a pipelined operator graph
Full text PdfPdf (642 KB)
Source Symposium on Discrete Algorithms archive
Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms table of contents
San Francisco, California, United States
Pages: 207 - 212  
Year of Publication: 2000
ISBN:0-89871-453-2
Authors
Petra Schuurman  Department of Mathematics and Computing Science, Eindhoven University of Technology, P.O. Box 513, NL-5600 MB Eindhoven, The Netherlands
Gerhard J. Woeginger  Institut für Mathematik B, TU Graz, Steyrergasse 30, A-8010 Graz, Austria
Sponsors
SIGACT: ACM Special Interest Group on Algorithms and Computation Theory
SIAM : Society for Industrial and Applied Mathematics
Publisher
Society for Industrial and Applied Mathematics  Philadelphia, PA, USA
Bibliometrics
Downloads (6 Weeks): 5,   Downloads (12 Months): 23,   Citation Count: 0
Additional Information:

references   index terms   collaborative colleagues  

Tools and Actions: Review this Article  

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
N. ALON, Y. AZAR, G.J. WOEGINGER, AND T. YA- parallel machines. Journal of Scheduling 1, 55-66.
2
3
 
4
5
 
6
7
 
8
H.W. LENSTRA {1983}. Integer programming with a fixed number of variables. Mathematics of Operations Research 8, 538-548.
 
9
J.K. LENSTRA AND D.B. SHMOYS {1995}. Computing near-optimal schedules. In: P. Chr~tienne, E.G. Coffman, Jr., J.K. Lenstra, and Z. Liu (eds.) Scheduling Theory and its Applications, Wiley, Chichester, 1-14.
 
10

Collaborative Colleagues:
Petra Schuurman: colleagues
Gerhard J. Woeginger: colleagues