# zbMATH — the first resource for mathematics

Elimination methods in the $$m\times n$$ sequencing problem. (English) Zbl 0237.90044

##### MSC:
 90B35 Deterministic scheduling theory in operations research 90C10 Integer programming
Full Text:
##### References:
 [1] Bagga, J. Can. Operations Res. Soc. 6 pp 71– (1968) [2] Dudek, Operations Research 12 pp 471– (1964) [3] Ignall, Operations Research 13 pp 400– (1965) [4] Karush, Operations Research 13 pp 323– (1965) [5] Smith, Operations Research 15 pp 71– (1967) [6] Operations Research 17 pp 756– (1969) [7] ”A Counterexample to a Solution Method of the m {$$\times$$} n Job Sequencing Problem,” Carnegie-Mellon University, School of Urban and Public Affairs (Feb. 1971).
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.