Author:
Post Gerhard,Ahmadi Samad,Geertsema Frederik
Publisher
Springer Science and Business Media LLC
Subject
Management Science and Operations Research,Business, Management and Accounting (miscellaneous)
Reference49 articles.
1. Abdullah S, Ahmadi S, Burke EK, Dror M (2007) Investigating Ahuja–Orlin’s large neighbourhood search approach for examination timetabling. OR Spectr 29: 351–372
2. Abdullah S, Ahmadi S, Burke EK, Dror M, McCollum B (2007) A tabu-based large neighbourhood search methodology for the capacitated examination timetabling problem. J Oper Res Soc 58: 1494–1502
3. Abramson D (1991) Constructing school timetables using simulated annealing: sequential and parallel algorithms. Manag Sci 37: 98–113
4. Agarwal R, Ahuja R, Laporte G, Shen Z (2003) A composite very large-scale neighborhood search algorithm for the vehicle routing problem. In: Handbook of scheduling: algorithms, models and performance analysis, Chap 49. Chapman & Hall/CRC, Boca Raton
5. Agarwal R, Ergun O, Orlin J, Potts C (2004) Solving parallel machine scheduling problems with variable depth local search. Working paper, Operations Research Center, MIT, Cambridge, MA
Cited by
10 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献