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

M. L. Smith; S. S. Panwalkar; R. A. Dudek

doi:10.1002/nav.3800230310

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

M. L. Smith, S. S. Panwalkar, R. A. Dudek

Industrial Engineering

Research output: Contribution to journal › Article › peer-review

25 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 language	English
Pages (from-to)	481-486
Number of pages	6
Journal	Naval Research Logistics
Volume	23
Issue number	3
DOIs	https://doi.org/10.1002/nav.3800230310
State	Published - 1976

Access to Document

10.1002/nav.3800230310

Cite this

@article{d2fe55792e274d5fa91bd3df8c492792,

title = "FLOWSHOP SEQUENCING PROBLEM WITH ORDERED PROCESSING TIME MATRICES: A GENERAL CASE.",

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.",

author = "Smith, {M. L.} and Panwalkar, {S. S.} and Dudek, {R. A.}",

year = "1976",

doi = "10.1002/nav.3800230310",

language = "English",

volume = "23",

pages = "481--486",

journal = "Naval Research Logistics",

issn = "0894-069X",

number = "3",

}

TY - JOUR

T1 - FLOWSHOP SEQUENCING PROBLEM WITH ORDERED PROCESSING TIME MATRICES

T2 - A GENERAL CASE.

AU - Smith, M. L.

AU - Panwalkar, S. S.

AU - Dudek, R. A.

PY - 1976

Y1 - 1976

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=0017001721&partnerID=8YFLogxK

U2 - 10.1002/nav.3800230310

DO - 10.1002/nav.3800230310

M3 - Article

AN - SCOPUS:0017001721

SN - 0894-069X

VL - 23

SP - 481

EP - 486

JO - Naval Research Logistics

JF - Naval Research Logistics

IS - 3

ER -

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

Abstract

Access to Document

Other files and links

Fingerprint

Cite this