Heuristics for unrelated machine scheduling with precedence constraints
暂无分享,去创建一个
[1] Jeffrey D. Ullman,et al. NP-Complete Scheduling Problems , 1975, J. Comput. Syst. Sci..
[2] Joseph Y.-T. Leung,et al. Scheduling Chain-Structured Tasks to Minimize Makespan and Mean Flow Time , 1991, Inf. Comput..
[3] Ronald L. Graham,et al. Bounds for certain multiprocessing anomalies , 1966 .
[4] D.J. Hoitomt,et al. Scheduling jobs with simple precedence constraints on parallel machines , 1990, IEEE Control Systems Magazine.
[5] T.C.E. Cheng,et al. A state-of-the-art review of parallel-machine scheduling research , 1990 .
[6] Oscar H. Ibarra,et al. Heuristic Algorithms for Scheduling Independent Tasks on Nonidentical Processors , 1977, JACM.
[7] Jeffrey M. Jaffe,et al. Algorithms for Scheduling Tasks on Unrelated Processors , 1981, JACM.
[8] C. D. Gelatt,et al. Optimization by Simulated Annealing , 1983, Science.
[9] C. N. Potts,et al. Analysis of a linear programming heuristic for scheduling unrelated parallel machines , 1985, Discret. Appl. Math..
[10] Steef L. van de Velde. Duality-Based Algorithms for Scheduling Unrelated Parallel Machines , 1993, INFORMS J. Comput..
[11] Jan Karel Lenstra,et al. Approximation algorithms for scheduling unrelated parallel machines , 1987, 28th Annual Symposium on Foundations of Computer Science (sfcs 1987).
[12] Cecilia R. Aragon,et al. Optimization by Simulated Annealing: An Experimental Evaluation; Part I, Graph Partitioning , 1989, Oper. Res..
[13] F. Darema,et al. Parallel Algorithms for Chip Placement by Simulated Annealing , 1987, IBM J. Res. Dev..
[14] Chris N. Potts,et al. Heuristics for scheduling unrelated parallel machines , 1991, Comput. Oper. Res..