On a conjecture for the university timetabling problem

DOI10.1016/J.DAM.2021.04.010MaRDI QIDQ2028068zbMATH OpenOpenAlexWikidataFDO

Authors Wieslaw Kubiak

Publication date 31 May 2021

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

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

zbMATH Keywords

combinatorial optimizationmultiprocessor operationsopen shop schedulingpolynomial-time algorithmstimetabling

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27)

Recommendations

• University timetabling by constraint-based reasoning: A case study
• A 0-1 integer programming approach to a university timetabling problem
• New constraints and features for the university course timetabling problem
• Efficient solutions for a university timetabling problem through integer programming
• Minimal perturbation in university timetabling with maximum satisfiability
• scientific article; zbMATH DE number 1223544

Cites work

• A generalized class-teacher model for some timetabling problems
• A projective algorithm for preemptive open shop scheduling with two multiprocessor groups
• Algorithms for Edge Coloring Bipartite Graphs and Multigraphs
• An introduction to timetabling
• Combinatorial optimization. Networks and matroids
• Complexity of some special types of timetabling problems
• Graph theory with applications
• scientific article; zbMATH DE number 3522018 (Why is no real title available?)
• scientific article; zbMATH DE number 1131873 (Why is no real title available?)
• Open Shop Scheduling to Minimize Finish Time
• Preemptive open shop scheduling with multiprocessors: Polynomial cases and applications

Cited in

(9)

• Polynomial reduction of time-space scheduling to time scheduling
• Decomposition, reformulation, and diving in university course timetabling
• Multiprofessor scheduling
• A generalized class-teacher model for some timetabling problems
• Time-tables, polyhedra and the greedy algorithm
• University timetabling by constraint-based reasoning: A case study
• Relation-algebraic specification and solution of special university timetabling problems
• A genetic algorithm for scheduling open shops with conflict graphs to minimize the makespan
• Scientific school of Academician V. S. Tanaev: results on the scheduling theory

This page was built for publication: On a conjecture for the university timetabling problem

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