Assignment of independent tasks to minimize completion time
暂无分享,去创建一个
[1] S. M. Johnson,et al. Optimal two- and three-stage production schedules with setup times included , 1954 .
[2] Sartaj Sahni,et al. Scheduling Independent Tasks with Due Times on a Uniform Processor System , 1980, JACM.
[3] Lui Sha,et al. Solutions for Some Practical Problems in Prioritized Preemptive Scheduling , 1986, RTSS.
[4] Karsten Schwan,et al. Experimental Evaluation of a Real-Time Scheduler for a Multiprocessor System , 1991, IEEE Trans. Software Eng..
[5] Jr King. Scheduling and the problem of computational complexity , 1979 .
[6] John K. Ousterhout. Scheduling Techniques for Concurrebt Systems. , 1982, ICDCS 1982.
[7] Lui Sha,et al. Performance of real-time bus scheduling algorithms , 1986, SIGMETRICS '86/PERFORMANCE '86.
[8] R. Daniel Bergeron,et al. Task Allocation Heuristics for Distributed Computing Systems , 1986, ICDCS.
[9] Karsten Schwan,et al. Global Data and Control in Multicomputers: Operating System Primitives and Experimentation with a Parallel Branch-and-Bound Algorithm , 1990, Concurrency Practice and Experience.
[10] Sartaj Sahni,et al. Preemptive Scheduling of a Multiprocessor System with Memories to Minimize Maximum Lateness , 1984, SIAM J. Comput..
[11] John K. Ousterhout,et al. Scheduling Techniques for Concurrent Systems , 1982, ICDCS.
[12] Wesley W. Chu,et al. Task Allocation in Distributed Data Processing , 1980, Computer.
[13] Sartaj Sahni,et al. Preemptive Scheduling with Due Dates , 1979, Oper. Res..
[14] Jane W.-S. Liu,et al. Dynamic Load Balancing Algorithms in Homogeneous Distributed Systems , 1986, IEEE International Conference on Distributed Computing Systems.