A053870 Acyclic orientations of Hamming graph (K_n) x (K_n).

1, 14, 19164, 6941592576

Offset

1,2

Comments

This number is equivalent to the number of plans (i.e. structural solutions) of the open shop problem with n jobs and n machines - see problems in scheduling theory.

References

Martin Harborth, Structural analysis of shop scheduling problems, PhD thesis, Otto-von-Guericke-Univ. Magdeburg, GCA-Verlag, 1999. (in German)

Links

Table of n, a(n) for n=1..4.

H. Bräsel, M. Harborth, T. Tautenhahn and P. Willenius, On the set of solutions of the open shop problem, Ann. Oper. Res. 92 (1999) 241-263.

Crossrefs

Sequence in context: A208194 A333954 A104376 * A283840 A079176 A344668

Adjacent sequences: A053867 A053868 A053869 * A053871 A053872 A053873

Keyword

nonn,nice,hard,more

Author

Martin Harborth (Martin.Harborth(AT)vt.siemens.de)

Status

approved