A particular timetable problem: Terminal scheduling

DOI10.1016/0898-1221(91)90239-ZzbMath0723.90036OpenAlexW2071565521MaRDI QIDQ2276867

András Sebő

Publication date: 1991

Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0898-1221(91)90239-z

zbMATH Keywords

bipartite graphspolynomial-time algorithmHungarian methodcomputer center workload planningtime-tabling

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Cites Work

• A classroom/time assignment model
• On the Complexity of Timetable and Multicommodity Flow Problems
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Some simple scheduling algorithms
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A particular timetable problem: Terminal scheduling