head tail tail tail mintime location sort the table using the mintime field task time to perform time to perform head tail tail tail tail tail there is an alternative implementation strategy which states that if location has the value tail then the task is added at the front of once all the tasks are assignedhead and tail can be concatenated to create the final complete queue when calculating the efficiency of the johnson' algorithmwe see that the data is processed as one observation at timethereby taking (ntime where is the volume of the data then the data must be sorted which will again take at least ( log ntime sinceo( log nterm dominates johnson' algorithm gives an optimal schedule in ( log ntime