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

1 December 1971

journal article
Published by Institute for Operations Research and the Management Sciences (INFORMS) in Operations Research

Vol. 19 (7) , 1753-1758
https://doi.org/10.1287/opre.19.7.1753

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)].

Keywords

IMPROVED COMBINATORIAL ALGORITHM
PAPER EXAMINES
COMBINATORIAL APPROACH
ASSUMPTIONS OUTLINED
DUDEK ALGORITHM
MACHINE FLOWSHOP

This publication has 0 references indexed in Scilit: