On a conjecture for the university timetabling problem
type: Item
instance of: scholarly article
title: On a conjecture for the university timetabling problem
zbMATH Open document ID: 1465.90028
published in: Discrete Applied Mathematics
publication date: 2021-05-31T00:00:00Z
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 90C27
zbMATH DE Number: 7352760
zbMATH Keywords: open shop scheduling
zbMATH Keywords: multiprocessor operations
zbMATH Keywords: timetabling
zbMATH Keywords: combinatorial optimization
zbMATH Keywords: polynomial-time algorithms
author: Wieslaw Kubiak
MaRDI profile type: Publication
full work available at URL: j.dam.2021.04.010
OpenAlex ID: W3157433032
Wikidata QID: Q113877238
cites work: A generalized class-teacher model for some timetabling problems
cites work: Q4099676
cites work: Q3097395
cites work: An introduction to timetabling
cites work: Complexity of some special types of timetabling problems
cites work: Preemptive open shop scheduling with multiprocessors: Polynomial cases and applications
cites work: Algorithms for Edge Coloring Bipartite Graphs and Multigraphs
cites work: Open Shop Scheduling to Minimize Finish Time
cites work: A projective algorithm for preemptive open shop scheduling with two multiprocessor groups
cites work: Combinatorial optimization. Networks and matroids
cites work: Q4382863
DOI: 10.1016/J.DAM.2021.04.010
Recommended article: University timetabling by constraint-based reasoning: A case study
Recommended article: Q3545768
Recommended article: New Constraints and Features for the University Course Timetabling Problem
Recommended article: Efficient solutions for a university timetabling problem through integer programming
Recommended article: Minimal perturbation in university timetabling with maximum satisfiability
Recommended article: Q4218845
description: scientific article; zbMATH DE number 7352760