Technical Note—An Improved Combinatorial Algorithm for the Flowshop-Scheduling Problem

Author:
Publisher website
Google Scholar
Abstract
This paper examines the combinatorial approach to the solution of the n-job, M-machine flowshop scheduling problem under the assumptions outlined by Dudek and Teuton [Opns. Res. 12, 471–497 (1964)] and proposes an improved combinatorial algorithm that, according to our computational experience, is more efficient than the Smith-Dudek algorithm [Opns. Res. 15, 71–82 (1967), and 17, 756 (1969)].