In this paper we study a single machine scheduling problem with the objective of minimizing sum completion times. Each given jobs is either short or long. However processing times are initially hidden to algorithm, but can be tested. This done by executing time oracle, which reveals job. test occupies unit in schedule, therefore algorithm must decide for it will call oracle. The value resulting...