On The Scheduling Of Identical Processors With Entrapment

In an attempt to reduce computational requirements, parallel processor tardiness related scheduling algorithms incorporate a fathoming condition, “entrapment,” which at times helps, whereas, at other times, increases CPU time requirements. This paper establishes certain guidelines that can be used as a priori rule deciding the inclusion or exclusion of the entrapment subroutine part of the scheduling algorithm to solve a given problem. Since entrapment is a dominance condition, the implications of this work can be used to examine the applicability of other such conditions in algorithms designed to solve NP complete problems.