FLOWSHOP SEQUENCING PROBLEM WITH ORDERED PROCESSING TIME MATRICES: A GENERAL CASE.

M. L. Smith, S. S. Panwalker, R. A. Duded

Research output: Contribution to journalArticle

36 Scopus citations

Abstract

The ordered matrix flow shop problem with no passing of jobs is considered. In an earlier paper, the authors have considered a special case of the problem and have proposed a simple and efficient algorithm that finds a sequence with minimum makespan for a special problem. This paper considers a more general case. This technique is shown to be considerably more efficient than are existing methods for the conventional flow shop problems.

Original languageEnglish
Pages (from-to)481-486
Number of pages6
JournalNaval Research Logistics
Volume23
Issue number3
DOIs
StatePublished - 1976

Fingerprint Dive into the research topics of 'FLOWSHOP SEQUENCING PROBLEM WITH ORDERED PROCESSING TIME MATRICES: A GENERAL CASE.'. Together they form a unique fingerprint.

  • Cite this