JSE_V5_N1_RP2 R. Siyabalapitiya M. Sandirigama Journal on Software Engineering 2230 – 7168 5 1 7 12 Multi-Processor, Greedy, Gang Scheduling In this study, the authors propose some greedy algorithms for the multi-processor job scheduling problem. A given list of jobs are arranged according to the time duration for processing. Depending on the job processing times, some jobs are divided into multi-threads while others remain as single thread jobs. Multi-thread jobs are processed based on the concept of gang scheduling. A lower bound for the total processing time is computed. The results of the proposed algorithm is presented using a percentage gap from the optimal solution using this lower bound. July - September 2010 Copyright © 2010 i-manager publications. All rights reserved. i-manager Publications http://www.imanagerpublications.com/Article.aspx?ArticleId=1202