Bounds on the average and minimum attendance in preference-based activity scheduling

DOI10.1016/J.DAM.2021.09.024MaRDI QIDQ2243142zbMATH OpenOpenAlexFDO

Authors L. Aronshtam, Hagai Ilani

Publication date 11 November 2021

Published in Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.dam.2021.09.024

zbMATH Keywords

hypergraph coloringlinearity of expectationLovász local lemmapreference-basedprobabilityscheduling

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Deterministic scheduling theory in operations research (90B35)

Recommendations

• Group activity selection problem with approval preferences
• Simplified group activity selection with group size constraints
• Designing Conferences to Improve Resource Utilization and Participant Satisfaction
• Collective schedules: axioms and algorithms
• Group activity selection from ordinal preferences

Cites work

• An integer programming model for assigning students to elective courses
• Graph colouring and the probabilistic method
• scientific article; zbMATH DE number 863491 (Why is no real title available?)
• Preference-based assignment of university students to multiple teaching groups

This page was built for publication: Bounds on the average and minimum attendance in preference-based activity scheduling

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