Article thumbnail

Flowshop Sequencing Problem with Ordered Processing Time Matrices

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

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.

DOI identifier: 10.1287/mnsc.21.5.544
OAI identifier:
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://dx.doi.org/10.1287/mnsc... (external link)

  • To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.

    Suggested articles