Counterexamples to optimal permutation s
β
S. S. Panwalkar; M. L. Smith; C. R. Woollam
π
Article
π
1981
π
John Wiley and Sons
π
English
β 117 KB
## Abstract It is well known that a minimal makespan permutation sequence exists for the __n__ Γ __3__ flow shop problem and for the __n__ Γ __m__ flow shop problem with no inprocess waiting when processing times for both types of problems are positive. It is shown in this paper that when the assum