Flowshop Sequencing Problem with Ordered Processing Time Matrices
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.
Year of publication: |
1975
|
---|---|
Authors: | Smith, M. L. ; Panwalkar, S. S. ; Dudek, R. A. |
Published in: |
Management Science. - Institute for Operations Research and the Management Sciences - INFORMS, ISSN 0025-1909. - Vol. 21.1975, 5, p. 544-549
|
Publisher: |
Institute for Operations Research and the Management Sciences - INFORMS |
Saved in:
Online Resource
Saved in favorites
Similar items by person
-
Flowshop sequencing problem with ordered processing time matrices
Smith, M. L., (1975)
-
Common due date assignment to minimize total penalty for the one machine scheduling problem
Panwalkar, S. S., (1982)
-
A heuristic for the single machine tardiness problem
Panwalkar, S. S., (1993)
- More ...