JSE_V4_N4_RP7 R. Siyambalapitiya M. Sandirigama Journal on Software Engineering 2230 – 7168 4 4 50 54 Multi-processor, Greedy, Scheduling In this study, we propose some simple greedy algorithms for the multi-processor job scheduling problem given list of jobs are arranged according to the time duration for processing. The results of the proposed algorithms are compared with the first-come first-serve (FCFS) job scheduling approach and shown to be superior. April - June 2010 Copyright © 2010 i-manager publications. All rights reserved. i-manager Publications http://www.imanagerpublications.com/Article.aspx?ArticleId=1178