A variant of the round-robin scheduling problem.

DOI10.61091/ARS158-09MaRDI QIDQ6550676zbMATH OpenFDO

Authors Chris Busenhart, Norbert Hungerbühler, William Xu

Publication date 5 June 2024

Published in Ars Combinatoria (Search for Journal in Brave)

Full work available at URL https://doi.org/10.61091/ARS158-09

zbMATH Keywords

round-robin problemseparating systems

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27) Applications of game theory (91A80)

Recommendations

• scientific article; zbMATH DE number 4174942
• On the organization of round robin tournaments with constraints
• Round-robin tournaments with homogeneous rounds
• Maximally pair separated round robin tournaments: ordering the blocks of a design
• Round robin scheduling -- a survey

Cited in

(1)

• Short note on a short proof of a variant of the round-robin scheduling problem

This page was built for publication: A variant of the round-robin scheduling problem.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6550676)