4 citations · 4 across the 2 of their papers we have counts for
2 papers
cs.DS2022★ 4 cited
An almost linear time complexity algorithm for the Tool Loading Problem
Mikhail Cherniavskii, Boris Goldengorin
As shown by Tang, Denardo [9] the job Sequencing and tool Switching Problem (SSP) can be decomposed into the following two problems. Firstly, the Tool Loading Problem (TLP) - for a…
math.OC2022
An improved KTNS algorithm for the job sequencing and tool switching problem
Mikhail Cherniavskii, Boris Goldengorin
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 app…