Solved

With the K & W Heuristic,when an Operation with the Smallest

Question 107

True/False

With the K & W heuristic,when an operation with the smallest number of predecessors has too long an operation time to be included in the station,the heuristic is programmed to look for the operation with the next smallest number of predecessors that fits the available time at the station and observes precedent constraints.

Correct Answer:

verifed

Verified

Unlock this answer now
Get Access to more Verified Answers free of charge

Related Questions