Time-Tabling Problems: Should They Be Canonical?

DOI10.1080/03155986.1986.11732014MaRDI QIDQ3748052zbMATH OpenOpenAlexFDO

Authors Dominique De Werra, C. Pasche, A. Petter

Publication date 1986

Published in INFOR: Information Systems and Operational Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/03155986.1986.11732014

zbMATH Keywords

computational experimentsedge colourings in bipartite multigraphsgeneralized time-tabling problem

Mathematics Subject Classification ID

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

Recommendations

• The combinatorics of timetabling
• Timetable construction: the algorithms and complexity perspective
• Complexity of some special types of timetabling problems
• A particular timetable problem: Terminal scheduling
• A generalized class-teacher model for some timetabling problems

Cited in

(6)

• Time-tables, polyhedra and the greedy algorithm
• A particular timetable problem: Terminal scheduling
• scientific article; zbMATH DE number 1729255 (Why is no real title available?)
• A particular timetable problem: terminal scheduling
• Timetable construction: the algorithms and complexity perspective
• Local optimization applied to a volunteer timetabling problem

This page was built for publication: Time-Tabling Problems: Should They Be Canonical?

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