login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A053870 Acyclic orientations of Hamming graph (K_n) x (K_n). 3
1, 14, 19164, 6941592576 (list; graph; refs; listen; history; internal format)
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

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

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

CROSSREFS

Sequence in context: A147686 A048913 A104376 * A079176 A013754 A073940

Adjacent sequences:  A053867 A053868 A053869 * A053871 A053872 A053873

KEYWORD

nonn,nice,hard

AUTHOR

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

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 14 23:53 EST 2012. Contains 205689 sequences.