login
The OEIS is supported by the many generous donors 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; text; 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
Martin Harborth, Structural analysis of shop scheduling problems, PhD thesis, Otto-von-Guericke-Univ. Magdeburg, GCA-Verlag, 1999. (in German)
LINKS
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
KEYWORD
nonn,nice,hard,more
AUTHOR
Martin Harborth (Martin.Harborth(AT)vt.siemens.de)
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified June 21 19:23 EDT 2024. Contains 373558 sequences. (Running on oeis4.)