تحلیل ریاضی دامنه مسئله زمانبندی گرافهای جهتدار به عنوان یک مسئله NP-Hard و ارائه الگوریتمی برای نمونه گیری با توزیع یکنواخت

مراجع و منابع این مقاله:

• J. K Lenstra, M. Veldhorst and B. Veltman. The complexity ...
• J. A. Hoogveen, J.K. Lenstra and B. Veltman. Three, four, ...
• T.G. Lewis and H. EI-Rewini, Introduction to parallel computing, Prentice-Hall, ...
• A. Munier and J.-C. Konig. A heuristic for a scheduling ...
• N. Alon, Y. Azar, G.J. Woeginger, and T. Yadid. Approximati ...
• F.E. Sandnes and G.M. Megson. Improved Static Multiproces sor Scheduling ...
• H. H. Ali, R. Vemulapalli. A new approach for task ...
• Eric W. Parsons. Using knowledge of job characteristics in mu ...
• R Graham. Bounds on Multiproces sing Timing Analysis. SIAM J.Computers, ...
• A.Gerasoulis and T. Yang. A comparison of clustring heuristics for ...
• Y.-K. Kwok and I. Ahmad, Dynamic critical-path scheduling: An effectrive ...
• 2] H.EI-Rewini and T.G. Lewis, Scheduling Parallel Programs onto Arbitrary ...
• T. Yang and A. Gerasoulis, DSC: Scheduling parallel Tasks _ ...
• A. M. S. Zalzala, P. J. Fleming. Genetic algorithms in ...
• Albert Y. Zomaya, Chris Ward, Ben Macey. Genetic Scheduling for ...
• F.Glover, Tabu search, ORSA Journal on computing, 1990, 4-32. ...
• P. Rebreyend and F. E. Sandnes. Static mul tiprocessor task ...
نمایش کامل مراجع