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

Jatinder N. D. Gupta
Additional contact information
Jatinder N. D. Gupta: Sangamon Slate University, Springfield, Illinois

Operations Research, 1971, vol. 19, issue 7, 1753-1758

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

Date: 1971
References: Add references at CitEc
Citations:

Downloads: (external link)
http://dx.doi.org/10.1287/opre.19.7.1753 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:oropre:v:19:y:1971:i:7:p:1753-1758

Access Statistics for this article

More articles in Operations Research from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().