References
- Even , S. , Itai , A. and Shamir , A. 1976 . On the complexity of timetable and multicommodity flow problems . STAM J. Comput , 5 ( 4 ) : 691 – 703 .
- Ford , L.R. Jr and Fulkerson , O.R. 1962 . Flows in Networks , Princeton, New Jersey : Princeton University Press .
- Garey , Johnson . 1979 . Computers and intractability , San Francisco : W. H. Freeman .
- Graham , R.L. , Lawler , E.L. , Lenstra , J.K. and Rinnooy Kan , A.H.G. 1979 . Optimization and approximation in deterministic sequences and scheduling: A survey . Annals of Discrete Math , 5 : 287 – 326 .
- Horn , I.W.A. 1974 . Some simple scheduling algorithms . Naval Res. Logist. Quart , 21 : 177 – 185 .
- Lawler , E.L. 1976 . Combinatorial optimization: Networks and matroids , Holt Rinehart and Winston .
- Z , L. 1979 . Combinatorial problems and exercises , Budapest : Akadémiai Kiadó .
- Mulvey , J.M. 1982 . A classroom/time Assignment model . European J. of Operational Research , 9 : 64 – 70 .
- Schmidt , J.G. and Ströhlein , T. 1982 . Timetable construction—an annotated bibliography . The Computer Journal , 23 ( 4 ) : 307 – 316 .
- De Werra , D. 1971 . Construction of school timetables by flow methods . Infor-Canad. J. Operational Res. and Information Processing , 9 ( 4 ) : 12 – 22 .