Tube-tap or Earliest Due Date : What happens when all jobs cannot be completed?

Abstract: In this thesis the scheduling algorithms Earliest Due Date (EDD) and Tube-tap were compared to each other. They were compared to see which algorithm generated more net profit. They were compared to each other in four different scenarios. In each scenario there were two different machines and five different jobs. Each machine had a cost and a processing rate, and each job had a length, a deadline, and a profit. In every scenario all jobs could not be completed before their deadline. The net profit was calculated by subtracting the gross profit by the machine cost. The results for the Tube-tap and EDD algorithms were almost the same for both algorithms in the different scenarios. There was one scenario where Tube-tap gained 0.5 more in profit. This was because Tube-tap had 0.5 in machine cost for one of the scenarios. The conclusions was that there should be more experimentation to see how more profitable Tube-tap can be. Specifically, there should be testing on scenarios where all jobs cannot be completed before their deadlines, but the number of operations does not exceed the available space before the last deadline.