  We outline a new Max Pipe Construction Algorithm (MPCA) with the purpose to
reduce the CPU time for the classic Keep Tool Needed Soonest (KTNS) algorithm.
The KTNS algorithm is applied to compute the objective function value for the
given sequence of jobs in all exact and approximating algorithms for solving
the Job Sequencing and Tool Switching Problem (SSP). Our MPCA outperforms the
KTNS algorithm by at least an order of magnitude in terms of CPU times. Since
all exact and heuristic algorithms for solving the SSP spend most of their CPU
time on applying the KTNS algorithm we show that our MPCA solves the entire SSP
on average 59 times faster for benchmark instances of D compared to current
state of the art heuristics.
