Compactness and balancing in scheduling
- 1 February 1977
- journal article
- Published by Springer Nature in Mathematical Methods of Operations Research
- Vol. 21 (1) , 65-73
- https://doi.org/10.1007/bf01918457
Abstract
No abstract availableKeywords
This publication has 4 references indexed in Scilit:
- On A Particular Conference Scheduling ProblemINFOR: Information Systems and Operational Research, 1975
- The Solution of a Timetabling ProblemIMA Journal of Applied Mathematics, 1972
- GRAPH COLORING ALGORITHMS††This research was supported in part by the Advanced Research Projects Agency of the Department of Defense under contract SD-302 and by the National Science Foundation under contract GJ-446.Published by Elsevier ,1972
- An upper bound for the chromatic number of a graph and its application to timetabling problemsThe Computer Journal, 1967