Sensitivity analysis of scheduling algorithms
暂无分享,去创建一个
[1] Ronald L. Graham,et al. Bounds on Multiprocessing Timing Anomalies , 1969, SIAM Journal of Applied Mathematics.
[2] Glenn K. Manacher,et al. Production and Stabilization of Real-Time Task Schedules , 1967, JACM.
[3] Jitender S. Deogun,et al. Inherently stable real-time priority list dispatchers , 1994, IEEE Parallel & Distributed Technology: Systems & Applications.
[4] E.L. Lawler,et al. Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey , 1977 .
[5] Jacek Blazewicz,et al. Scheduling in Computer and Manufacturing Systems , 1990 .
[6] Yang Tao,et al. Applications of Graph Scheduling Techniques in Parallelizing Irregular Scientific Computation , 1995 .
[7] Eugene L. Lawler,et al. Chapter 9 Sequencing and scheduling: Algorithms and complexity , 1993, Logistics of Production and Inventory.
[8] Behrooz Shirazi,et al. Analysis and Evaluation of Heuristic Methods for Static Task Scheduling , 1990, J. Parallel Distributed Comput..
[9] Eugene L. Lawler,et al. Sequencing and scheduling: algorithms and complexity , 1989 .
[10] Patrick Jaillet,et al. A Priori Optimization , 1990, Oper. Res..
[11] William L. Maxwell,et al. Theory of scheduling , 1967 .
[12] Eric Sanlaville,et al. Scheduling with Communication Delays and On-Line Disturbances , 1999, Euro-Par.
[13] Dorit S. Hochbaum,et al. Approximation Algorithms for NP-Hard Problems , 1996 .