×

zbMATH — the first resource for mathematics

Permutation flow-shop theory revisited. (English) Zbl 0413.90030

MSC:
90B35 Deterministic scheduling theory in operations research
68R99 Discrete mathematics in relation to computer science
05A05 Permutations, words, matrices
PDF BibTeX XML Cite
Full Text: DOI
References:
[1] Arthanari, Naval Research Logistics Quarterly 15 pp 135– (1971)
[2] Gupta, Operations Research 19 pp 1753– (1971)
[3] Gupta, Naval Research Logistics Quarterly 22 pp 255– (1975)
[4] Ignall, Operations Research 13 pp 400– (1965)
[5] Johnson, Naval Research Logistics Quarterly 1 pp 61– (1954)
[6] Sequencing By Enumerative Methods, Chapter 12, (Mathematisch Centrum, Amsterdam, 1976).
[7] McMahon, Canadian Operational Society Journal 7 pp 141– (1969)
[8] Nabeshima, Journal of Operations Research Society of Japan 3 pp 170– (1960)
[9] Journal of Operations Research Society of Japan 4 pp 1– (1961)
[10] Nabeshima, Parts 1 and 2, Reports of the University of Electro-Communications 27 pp 245– (1977)
[11] Smith, Operations Research 15 pp 71– (1967)
[12] Smith, Management Science 21 pp 544– (1975)
[13] Smith, Naval Research Logistics Quarterly 23 pp 481– (1976)
[14] Szwarc, Operations Research 21 pp 1250– (1971)
[15] Szwarc, Naval Research Logistics Quarterly 21 pp 145– (1974)
[16] Szwarc, Naval Research Logistics Quarterly 24 pp 483– (1977)
[17] ”Precedence Relations of the Flow-Shop Problem,” submitted to Operations Research. · Zbl 0473.90045
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.