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.
No takes yet. Share an insight, caveat, or question.
Smith et al. (1975) studied this question.
Synapse has enriched 3 closely related papers on similar clinical questions. Consider them for comparative context: