Flowshop Sequencing Problem with Ordered Processing Time Matrices

M. L. Smith, S. S. Panwalkar and R. A. Dudek
Additional contact information
M. L. Smith: Texas Tech University
S. S. Panwalkar: Texas Tech University
R. A. Dudek: Texas Tech University

Management Science, 1975, vol. 21, issue 5, 544-549

Abstract: A flowshop sequencing problem having an ordered processing time matrix is defined. Job and machine characteristics resulting in processing time relationships that have logical and practical bases are discussed. An optimizing solution procedure for a special class of ordered matrix problem is presented along with proof of optimality.

Date: 1975
References: Add references at CitEc
Citations: View citations in EconPapers (24)

Downloads: (external link)
http://dx.doi.org/10.1287/mnsc.21.5.544 (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:ormnsc:v:21:y:1975:i:5:p:544-549

Access Statistics for this article

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