A Three Phased Approach To Final Exam Scheduling

REFERENCES

• Arani , T. , “ A Multi-Phase Final Examination Scheduling Problem .” Doctoral Dissertation , SUNYAB , 1986 .
   Google Scholar
• Balas , E. , “ An Additive Algorithm for Solving Linear Programs with Zero-one Variables .” Operations Research , 1965 , 13 , 517 – 546 .
   Web of Science ®Google Scholar
• Brelaz , D. , “ New Method to Color die Vertices of a Graph .” Corn-munication ftht ACM , 1979 , 22 , 251 – 256 .
   Web of Science ®Google Scholar
• Brown , J. R. , “ Chromatic Scheduling and the Chromatic Number Problem .” Management Science , 1972 , 19 , 456 – 463 .
   Web of Science ®Google Scholar
• Broder , S. , “ Final Examination Scheduling .” Communication of the ACM , 1964 , 7 , 494 – 498 .
   Web of Science ®Google Scholar
• Burhard , R. E. and Stratman , K. H. , “ Numerical Investigations on Quadratic Assignment Problems .” Naval Research Logistic Quarterly , 1978 , 25 , 12948 .
   Google Scholar
• Carter , M. W. , “ A Decomposition Algorithm for Practical Timetabling Problems .” University of Toronto,DepL of industrial Engineering , Working Paper No. 83–86 , 1983 .
   Google Scholar
• Carter , M. W. , private communication .
   Google Scholar
• Carlson , R. and Nemhauser , G. , “ Scheduling to Minimize Interaction Cost ” Operations Research , 1967 , 14 , 52 – 58 .
   Web of Science ®Google Scholar
• Christofides , N. , ” An Algorithm for Chromatic Number of a Graph .” Computer Journal , 1971 , 14 , 38 – 39 .
   Web of Science ®Google Scholar
• Cole , A. J. , “ The Preparation of Examination Time-table Using a Small-Store Computer .” Computer Journal , 1964 , 117 – 121 .
   Web of Science ®Google Scholar
• Colijn , A. W. , “ Reduction of Second Order Conilict in Examination Timetables .” As cited in White and Chan ( 1979 ).
   Google Scholar
• Comcil , D. G. ,and Graham , B. , “ An Algorithm for Determining the Chromatic Number of a Graph .” SI AM Journal of Computing , 1973 , 2 , 311 – 318
   Google Scholar
• Dunston , F. D. J. , “ Sequential Colorings of Graphs .” Proc. 5th British Comb. Conf., Aberdeen, 1975,Cong. Num. XV, UtiliiasMath. , 1976 , 151 – 158 .
   Google Scholar
• Desroches , S. , Laporte , G. and Rousseau , J M. ,” HOREX A Computer Program for the Construction of Examination Schedules .” IN FOR , 1978 , 16 , 294 – 298 .
   Google Scholar
• Grimes , J. , “ Scheduling to Reduce Conflict in Meetings .” Communications of the ACM . 1970 , 13 , 351 – 352 .
   Web of Science ®Google Scholar
• Hall , A. and Acton , F. , “ Scheduling University Course Examinations by Computers .” Communications of the ACM , 1967 , 10 , 235 – 238 .
   Web of Science ®Google Scholar
• Held , K. and Karp , R. M. , “ The Traveling Salesman Problem and Minimum Spanning Trees .” Operations Research , 1970 , 18 , 1138 – 1162 .
   Web of Science ®Google Scholar
• Korman , S. M. , The Graph-Coloring Problem . In Combinatorial Optimization , John Wiley and Sons , New York , 1979 .
   Google Scholar
• Leighton , F. , “ A Gaph Coloring Algorithm for Large Scheduling Problems .” Journal of Research of the National Bureau of Standard , 1979 , 84 , 489 – 506 .
   Google Scholar
• Lotfi , V. and Sarin , A. , “ A Graph Coloring Algorithm for Large Scale Scheduling Problems .” CORS , Forthcoming .
   Google Scholar
• Manila , D.W. , Marble , G. and lsaacon , I.B. , “ Graph Coloring Algorithms .” In Graph Theory and Computing , Ed. , New York , Academic Press , 1972 .
   Google Scholar
• Mehta , N. K. , “ The Application of a Graph Coloring Mthod to an Examination Scheduling Problem .” Interface , 1981 , 11 , 57 – 64 .
   Google Scholar
• Murtagh , B. A. and Jefferson , T. R. , “ A Heuristic Procedure for Solving the Quadratic Assignment Problem .” European Journal of Operational Research , 1982 , 9 , 71 – 76 .
   Web of Science ®Google Scholar
• Paul , M. C. and Unger , S. H. , “ Minimizing the Number of States in Incompletely Specified Switching Function .” As Cited in Hall and Acton , 1967 .
   Google Scholar
• Peck , J. E. L. and Williams , M. R. , “ Algorithm 286 Examination Scheduling .” Communications o f the ACM , 1969 , 9 , 433434.
   Google Scholar
• Pierce , J. F. and Laslcy , J. S. , “ Improved Combinatorial Programming Algoridims for a Class of all Zero-One Integer Programming Problems .” Management Science , 1973 , 19 , 528 – 543 .
   Web of Science ®Google Scholar
• Salozar , A. and Oakford , R. V. , “ A Graph Formulation of a School Scheduling Algorithm .” Communications of the ACM , 1974 , 12 , 696 – 698 .
   Web of Science ®Google Scholar
• Tripathy , A. , “ A LagTangian Relaxation Approach toCourse Timetabling .” Journal of the Operational Research Society , 1980 , 31 , 599 – 603 .
   Web of Science ®Google Scholar
• Vishnevskii L. , “ A Scheduling Problem .” Cybernetics , May-June , 1976 , 115 – 118 .
   Google Scholar
• Wang , C. C. , “ An Algorithm for the Chromatic Number of a Graph .” Journal of ACM , 1974 , 21 , 385 – 391 .
   Web of Science ®Google Scholar
• Welsh , D. J. A. and Powell , M. B. , “ An Upper Bound for the Chromatic Number of a Graph and Its Application to Timetabling Problems .” Computer Journal , 1967 , 10 , 85 – 86 .
   Web of Science ®Google Scholar
• White , G. and Chan , P. , “ Towards the Construction of Optimal Examination Schedules .” Canadian Journal of Operational Research and Information Processing , 1979 , 17 , 2 19 – 229 .
   Web of Science ®Google Scholar
• Williams , M. R. , “ Heuristic Procedures-(If they work, leave them alone) .” Software Practice and Experience , 1974 , 4 , 237 – 240 .
   Google Scholar
• Wood , D. C. , “ A System for Computing University Examination The -tables .” Computer Journal , 1968 , 11 , 41 – 47 .
   Web of Science ®Google Scholar
• Zykov , A. A. , “ On Some Properties of Linear Complexes .” Mat. s.b. , 1949 , 24 , 163 – 188 , Amr. Math. Soc, Translation NO. 79, 1952 .
   Google Scholar