Abstract
A new and interesting heuristic related to the shortest processing time rule (SPT) in the context of dynamic job shop has recently been reported and referred to as CEXSPT (Schultz 1989). Perusal of the literature regarding CEXSPT aroused interest in the performance of the heuristic and possible improvements to it. This paper intends to share this interest and attempts a further exploration of the CEXSPT rule.