zbMATH — the first resource for mathematics

Flowshop sequencing problem with ordered processing time matrices: A general case. (English) Zbl 0336.90026

90B35 Deterministic scheduling theory in operations research
60K25 Queueing theory (aspects of probability theory)
90B15 Stochastic network models in operations research
Full Text: DOI
[1] Johnson, Nav. Res. Log. Quart. 1 pp 61– (1954)
[2] ”Some Remarks on the Complexity of Combinatorial Optimization Problem,” presented at the 41st Meeting of ORSA, New Orleans, Louisiana, Apr. 1972.
[3] , and , ”Job Sequencing with Ordered Processing Time Matrix,” presented at the 43rd Meeting of ORSA, Milwaukee, Wisconsin, May 1973.
[4] Smith, Man. Sci. 21 pp 544– (1975) · Zbl 0302.90025 · doi:10.1287/mnsc.21.5.544
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.