An algorithm is derived, which solves the completion time variance (CTV) problem with equal processing times in O( n log n) time. This result indicates that the special case formulated by Merten and Muller [1] is well solvable.
One platform for all researcher needs
AI-powered academic writing assistant
Your #1 AI companion for literature search
AI tool for graphics, illustrations, and artwork
Unlock unlimited use of all AI tools with the Editage All Access membership.
Explore Editage All AccessPublished in last 50 years