Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A053870
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A053870 Acyclic orientations of Hamming graph (K_n) x (K_n). +0
4
1, 14, 19164, 6941592576 (list; graph; listen)
OFFSET

1,2

COMMENT

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 this_sequence A079176 A013754 A073940

Adjacent sequences: A053867 A053868 A053869 this_sequence A053871 A053872 A053873

KEYWORD

nonn,nice,hard

AUTHOR

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

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified December 21 10:15 EST 2009. Contains 171081 sequences.


AT&T Labs Research