Farideh A. Samadzadeh
- 1.L. Bodin, 'Routing and Scheduling of Vehicles and Crews,' Computtrs and Optrmioa. f Reuarch, Vol. 10, No. 2. 1983.Google Scholar
- 2.T. C. E. Cheng and C. C. S. Sin, 'A Stato.of-the-Att Review of Ptrallcl-Machine Scheduling Rese. a~h,' E~opean Journal of Operational Rtuarcb, Vol 47, Elsevier Science Publishers, North-Holland, 1990, pp. 217-292.Google Scholar
- 3.E. G. Cotfman, and R. L. Graham, "Optin,d Scheduling for Two-Processor Systems," Acta lnformatica, Vol. 1, No. 3, 1972, pp. 200-213.Google Scholar
- 4.E. G. CoEman and P. J. Denning, Operating $y:tenu Theory, Prcn6ce-H&ll Publishing Co., N. J., 1973.Google Scholar
- 5.E. G. Cotfman, Computers and Job-Shop $chedulin8 Theory, John Wiley and Sons, N. Y. H, 1976.Google Scholar
- 6.E.G. Coifman, Jr., M. R. Garey, and D. S. Johnson, 'An AppUcation of Bin-Packing to Multilnoc~sor Scheduling,"Google Scholar
- 7.E. W. Davis, "Project Scheduling under Rosou~e Constraints - Historical Review and Categorization of Procedures," AIIE TranJaction.~, Vol. 5, No. 4, 1973, pp. 297-313.Google Scholar
- 8.M. A. Franklin, G. G. Graham, and R. K. Gupta, "AnomaUes with Variable Partition Palling Algorithms,' Communications of the ACM, Vol. 21, No. 3, 1978, pp. 232-236. Google ScholarDigital Library
- 9.P. C. Gilmore and R. E. C.,o~ 'A Linear Programming Approach to the Cutting Stock Progtants," Operations Re:catch, Vol. 9, 1961, pp. 849-859.Google Scholar
- 10.R. L. Graham, 'Bounds on ldultiptoGessor Timing Anomalies," S/AM Journal of Applied Mathematics, Vol. 17, No, 2, Mar. 1969, pp. 416-429.Google Scholar
- 11.R. L. Graham, Bounds on the Pgrformanc~ of Schcdulin8 Algorithms, Computer and Job/Shop Scheduling Theory, (E. O. Coffman, Ed.), }ohn Wiley, New York, 1976.Google Scholar
- 12.S. Ha and E. A. Lee, 'Compile-Time $cheduting and Assignment of Data-Flow Program Graphs with Data- Dependent Iterations,' i~EE Transactiont on Computers, Vol. 40, No. I 1, Nov. 1991, pp. 1225-1238. Google ScholarDigital Library
- 13.T. C. Hu, "Parallel Sequencing and Assembly Line Problems," Operations Research, Vol. 9, Nov.-De~. 1961. pp. 841-848.Google Scholar
- 14.D. S. Johnson, A. Dcme. rs, I. D. Ullman, M. R. Oawy, and R. L. Graham, 'Worst-Case Petfommnce Bounds for Simple One-Dimensional Packing Algorithms," S/AM Journal of Computing, Vol. 3, No. 4, Dec. 1974, pp. 299-326.Google Scholar
- 15.H. Kasahara and S. Narita, "Practical Multiptocessor Scheduling Algorithms for Efficient Parallel ~essing," iEEE Transactions on ComputerJ, Vol. C-33, No. 11, Nov. 1984, pp. 1023-1029.Google Scholar
- 16.R. McNaughton, '$chentuling with I~a~16n~ and Loss Functions'" Management Science, Vol. 6, Jan. 1959, pp. 1-12.Google ScholarDigital Library
- 17.R. R. Muntz and E. G. Coffman, "Optimal Multiprocessor Scheduling on Two-Processor Systems.' IEEE Transactions on Computers, Vol. C- 18, No. 11, Nov. 1969, pp. 1014-1020.Google Scholar
- 18.$. J. Nomnha and V. V. S. Sarma, 'Knowledge-Based Approach for Scheduling Problems: A Survey," IEEE Transactions on Knowledge and Data ~ngiMering, Vol. 3, No. 2, June 1991, pp. 160-171. Google ScholarDigital Library
- 19.C. Polychmnopoulos, Parallel Programming and Compiler#, Kluwcr Acadcmic Publishing, Norwcl, MA, 1988. Google ScholarDigital Library
- 20.F. A. Samadzadeh and G. E. Hedrick, "Near-Optimal Muhiproccssor Scheduling," to &ppcar in thc Proceedings of the 1992 Computer Science Conference, Kansas City, Me, March 1992. Google ScholarDigital Library
- 21.S. D. Ullman, 'Complexity of Sequencing Problems,' in Computers and Job-Shop Scheduling, E. O. Coffin,a, Ed., John Wilcy and Sons, N. Y., 1967.Google Scholar
Index Terms
- A heuristic multiprocessor scheduling algorithm for creating near-optimal schedules using task system graphs
Recommendations
Multi-heuristic list scheduling genetic algorithm for task scheduling
SAC '03: Proceedings of the 2003 ACM symposium on Applied computingScheduling tasks on a multi-processor system involves making a choice as to the order in which several tasks can be executed and assigned to processors. The problem is to find a schedule that will minimize the execution time of a program. Because task ...
Scheduling chained multiprocessor tasks onto large multiprocessor system
In this paper, we proposed an effective approach for scheduling of multiprocessor unit time tasks with chain precedence on to large multiprocessor system. In this work, we considered splitable and non-splitable multiprocessor tasks, which is a new and ...
A multiprocessor task scheduling model for berth allocation: heuristic and worst-case analysis
We consider a scheduling problem in which the processors are arranged along a straight line, and each job requires simultaneous processing by multiple consecutive processors. We assume that the job sizes and processing times are agreeable. Our objective ...
Comments