Practice Abstracts

References

• Clarke G., Wright J. Scheduling of vehicles from a central depot to a number of delivering points. Oper. Res. (1964) 12(4):568–581Link, Google Scholar
• Fisher M. L., Jaikumar R. A generalized assignment heuristic for vehicle routing. Networks (1981) 11(2):109–124Crossref, Google Scholar
• Gillett B. E., Miller L. R. A heuristic algorithm for the vehicle dispatch program. Oper. Res. (1974) 22(2(W. H. Freeman, San Francisco, CA) 340–349Link, Google Scholar
• Garey M. R., Johnson D. S.Computers and Intractability: A Guide to the Theory of NP-Completeness (1979) (W. H. Freeman, San Francisco, CA) Google Scholar
• Ho W. K., Lim A. A hybrid-based framework for constraint satisfaction optimization problems. Proc. 22nd Internat. Conf. Inform. Systems (ICIS 2001) (2001) New Orleans, LA:65–76Google Scholar
• Lim A., Ang J. C., Ho W. K., Oon W. C. UTTSExam: A campus-wide university exam-timetabling system. 14th Innovative Applications in Artificial Intelligence Conf. (IAAI-2002) (2002) Edmonton, Alberta, Canada:838–844Google Scholar
• Tsang E.Foundations of Constraint Satisfaction (1993) (Academic Press, London, U.K) Google Scholar