| 期刊論文| 1. | Adolphson, D. L.(1977)。Single machine job sequencing with precedence constraints。SIAM Journal on Computing，6，40-54。   | | 2. | Lawler, E. L.(1978)。Sequencing jobs to minimize total weighted completion time subject to precedence constraints。Annals of Discrete Mathematics，2，75-90。 | | 3. | Lenstra, J. K.、Rinnooy Kan, A. H. G.、Brucker, P.(1977)。Complexity of machine scheduling problems。Annals of Discrete Mathematics，1，343-362。 | | 4. | McNaughton, R.(1959)。Scheduling with deadlines and loss functions。Management Science，6，1-12。 | | 5. | Horn, W. A.(1972)。Single machine job sequencing with treelike precedence ordering and linear delay penalties。SIAM Journal on Applied Mathematics，23(2)，189-202。 | | 6. | Garey, M. R.(1973)。Optimal task sequencing with precedence constraints。Discrete Mathematics，4(1)，37-56。 | | 7. | Adolphson, D.、Hu, T. C.(1973)。Optimal linear ordering。SIAM Journal on Applied Mathematics，25(3)，403-423。 | | 8. | Sidney, J. B.(1975)。Decomposition algorithms for single-machine sequencing with precedence relations and deferral costs。Operations Research，23(2)，283-298。 | | 9. | Hsn, C. C.、Wang, S. D.、Kuo, T. S.(1989)。Efficient task assignment for distributed computing systems。Journal of the Chinese Institute of Engineers，12(3)，317-329。 | | 10. | Lawler, E. L.、Wood, D. E.(1966)。Branch-and-bound methods: a survey。Operations Research，14(4)，699-719。 | | 11. | Blake, B. A.、Schwan, K.(1991)。Experimental evaluation of a real-time scheduler for a multiprocessor system。IEEE Transactions on Software Engineering，17(1)，34-44。 | | 12. | Bokhari, S. H.(1981)。A shortest tree algorithm for optimal assignments across space and time in a distributed processor system。IEEE Transactions on Software Engineering，7(6)，583-589。 | | 13. | Wang, L. L.、Tsai, W. H.(1988)。Optimal assignment of task modules with precedence for distributed processing by graph matching and state space search。BIT Numerical Mathematics，28(1)，54-68。 | | 14. | Shen, C. C.、Tsai, W. H.(1985)。A graph Matching Approach to Optimal Task Assignment in Distributed Computing Systems Using a Minimax Criterion。IEEE Transactions on Computers，34，197-203。 | | 15. | Sinclair, J. B.(1987)。Efficient Computation of Optimal Assignments for Distributed Tasks。Journal of Parallel and Distributed Computing，342-362。 | | 16. | Sethi, Ravi(1977)。On the Complexity of Mean Flow Time Scheduling。Mathematics of Operations Research，2(4)，320-330。 | 會議論文| 1. | Ramamritham, K.、Stankovic, J. A.、Shiah, P. F.(1989)。O(n) scheduling algorithms for real-time multiprocessor systems。The International Conference on Parallel Processing，143-152。 | 圖書| 1. | Nilsson, N. J.(1980)。Principles of Artificial Intelligence。Palo Alto, Calif：Tioga Publishing。 | | 2. | Conway, R. W.、Maxwell, William L.、Miller, Louis W.(1967)。Theory of Scheduling。Reading, Mass.：Addison-Wesley。 | | 3. | Garey, Michael R.、Johnson, David S.(1979)。Computers and Intractability: A Guide to the theory of NP-Completeness。W. H. Freeman and Company。 | |