Mathematical Scheduling
Article Sidebar
Main Article Content
Abstract
Often companies or organizations hold large conferences, with the goal of dispensing vast amounts of information to a diverse set of people. They also may wish to maintain a high level of interaction within small groups of participants. A model to design the groups of such a seminar should be built in such a way as to allow different classes of participation. We use basic ideas from modem combinatorics to develop methods for placing attendees into blocks. We then employ a greedy algorithm that chooses column shifts to be performed on these blocks. The combination of these two methods improves upon the results typically obtained from the combinatorial methods. Our algorithm is much faster than current greedy techniques.
Downloads
Download data is not yet available.
Article Details
Section
Articles
IUSB Student Journal Copyright Agreement
☐ I declare that this submission is my original work, and that it does not, to the best of my knowledge, infringe upon anyone's copyright.
☐ I agree that that [the journal] may, without changing the content, translate the submission to any medium or format for the purpose of preservation.
☐ The Undergraduate Research Journal may keep copies of my submission, and to translate it to any medium for future reproduction and distribution. I understand that I have the right to request that my submission be removed from IUSB online sources at any time by emailing Stephen Finlay, IUSB ScholarWorks administrator, at scfinlay@iusb.edu. Once I have made the request, the item in question will be taken down immediately.