Flowshop Sequencing Problem with Ordered Processing Time Matrices

1 January 1975

journal article
Published by Institute for Operations Research and the Management Sciences (INFORMS) in Management Science

Vol. 21 (5) , 544-549
https://doi.org/10.1287/mnsc.21.5.544

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.

Keywords

OPTIMALITY
FLOWSHOP
SEQUENCING PROBLEM
JOB
PROCEDURE
MACHINE
SPECIAL
LOGICAL
ORDERED PROCESSING
PROCESSING TIME