Scheduling to reduce conflict in meetings

Authors:
Joseph E. Grimes
Affiliations:
Cornell Univ., Ithaca, NY
Venue:
Communications of the ACM
Year:
1970

Citing 5
Cited 0

An algorithm for class scheduling with section preference

Communications of the ACM
Algorithms for finding a fundamental set of cycles for an undirected linear graph

Communications of the ACM
Final examination scheduling

Communications of the ACM
Scheduling meetings with a computer

Communications of the ACM
The Structure of SNOBOL4

The Structure of SNOBOL4

Quantified Score

Hi-index	48.22

Visualization

Abstract

Conflicts in scheduling can be treated as defining an undirected linear graph independently of the relation of the activities in conflict to additional constraints of time and space. Each connected component of such a graph, which can be found by an algorithm described by Gotlieb and Corneil, corresponds to a set of events that must be scheduled at different times.