JSE_V11_N3_RP5 R. Siyambalapitiya Journal on Software Engineering 2230–7168 11 3 40 44 Interval Scheduling, Greedy Algorithm, Upper Bound Placing a set of activities or jobs along a timeline is known as scheduling. The interval scheduling problem arises when each job is specified by an interval with starting and finishing times of each job. It will become a weighted interval scheduling problem when a weight or a value is associated with each job. In this paper, the aim is to maximize the total weight of the jobs that could be scheduled without overlapping. A fast algorithm is presented to solve this problem. An upper bound for the total weight is computed and it is shown that the gap between the solutions to the test problems and the upper bound is extremely small. January - March 2017 Copyright © 2017 i-manager publications. All rights reserved. i-manager Publications http://www.imanagerpublications.com/Article.aspx?ArticleId=13633