Algorithm 520: An Automatic Revised Simplex Method for Constrained Resource Network Scheduling [H]

Full Text: PDFPDF Buy this ArticleBuy this Article
Authors: Jan Weglarz Institute of Control Engineering, Technical University of Poznan, Piotrowo 3a, 60 965 Poznan, Poland
Jacek Blazewicz Institute of Control Engineering, Technical University of Poznan, Piotrowo 3a, 60 965 Poznan, Poland
Wojciech Cellary Institute of Control Engineering, Technical University of Poznan, Piotrowo 3a, 60 965 Poznan, Poland
Roman Slowinski Institute of Control Engineering, Technical University of Poznan, Piotrowo 3a, 60 965 Poznan, Poland
Algorithm 520: An Automatic Revised Simplex Method for Constrained Resource Network Scheduling [H] Published by ACM 1977 Article
Bibliometrics Data  Bibliometrics
· Downloads (6 Weeks): 3
· Downloads (12 Months): 18
· Downloads (cumulative): 507
· Citation Count: 2

Published in:
· Journal
ACM Transactions on Mathematical Software (TOMS) TOMS Homepage archive
Volume 3 Issue 3, Sept. 1977
Pages 295-300
ACM New York, NY, USA
table of contents doi>10.1145/355744.355755

Tools and Resources

Share:

|
feedback Feedback | Switch to single page view (no tabs)

Powered by The ACM Guide to Computing Literature


The ACM Digital Library is published by the Association for Computing Machinery. Copyright © 2013 ACM, Inc.
Terms of Usage   Privacy Policy   Code of Ethics   Contact Us

Useful downloads: Adobe Acrobat    QuickTime    Windows Media Player    Real Player
The ACM Guide to Computing Literature
All Tags
Export Formats
 
 
Save to Binder