On a conjecture for the university timetabling problem

DOI10.1016/j.dam.2021.04.010zbMath1465.90028OpenAlexW3157433032WikidataQ113877238 ScholiaQ113877238MaRDI QIDQ2028068

Wiesław X. 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 optimizationtimetablingopen shop schedulingpolynomial-time algorithmsmultiprocessor operations

Mathematics Subject Classification ID

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

Related Items (1)

A genetic algorithm for scheduling open shops with conflict graphs to minimize the makespan

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• An introduction to timetabling
• Preemptive open shop scheduling with multiprocessors: Polynomial cases and applications
• A projective algorithm for preemptive open shop scheduling with two multiprocessor groups
• Complexity of some special types of timetabling problems
• A generalized class-teacher model for some timetabling problems
• Algorithms for Edge Coloring Bipartite Graphs and Multigraphs
• Open Shop Scheduling to Minimize Finish Time

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