On Scheduling in a Semi-Ordered Flow Shop without Intermediate Queues

Abstract The dynamic programming solution offered is of complexity O(n 2) and is a significant improvement over the implicit enumeration procedure previously suggested by Arora and Rana in an article in the September 1980 issue of TRANSACTIONS.