MPI Parallelization of Variable Neighborhood Search

Electronic Notes in Discrete Mathematics

Volumn 39, Issue , 2012, Pages 241-248

  Davidović, Tatjana ^a   Crainic, Teodor Gabriel ^b  

^a MATHEMATICAL INSTITUTE   (Serbia)

^b UNIVERSITÉ DU QUÉBEC À MONTRÉAL   (Canada)

Author keywords

Asynchronous Cooperation; Information Exchange; Multiprocessor Scheduling

Indexed keywords

EID: 84870281882     PISSN: None     EISSN: 15710653     Source Type: Journal    
DOI: 10.1016/j.endm.2012.10.032     Document Type: Article

References (16)

1. Crainic T.G., Gendreau M., Hansen P., Mladenović N. Cooperative parallel variable neighborhood search for the p-median. J. Heur. 2004, 10:293-314.
2. Davidović T., Crainic T.G. Benchmark problem instances for static task scheduling of task graphs with communication delays on homogeneous multiprocessor systems. Comput. Oper. Res. 2006, 33:2155-2177.
3. Davidović T., and T. G. Crainic, Parallel local search to schedule communicating tasks on identical processors, (submitted), (2011).
4. Davidović T., Hansen P., Mladenović N. Permutation based genetic, tabu and variable neighborhood search heuristics for multiprocessor scheduling with communication delays. Asia Pac. J. Oper. Res. 2005, 22:297-326.
5. Davidović, T., L. Liberti, N. Maculan, and N. Mladenović, Towards the optimal solution of the multiprocessor scheduling problem with communication delays, In Proc. 3rd Multidisciplinary Int. Conf. on Scheduling: Theory and Application, Paris, France, (2007), 128-135.
6. García-López F., Melián-Batista B., Moreno-Pérez J.A., Moreno-Vega J.M. The parallel variable neighborhood search for the p-median problem. J. Heur. 2002, 8:375-388.
7. Garey M.R., Johnson D.S. Computers and Intractability: A Guide to the Theory of NP-Completeness 1979, W. H. Freeman & Co, New York, USA.
8. Hansen P., Mladenović N. Variable neighbourhood search. Search Methodologies: Introductory Tutorials in Optimization and Decision Support Techniques 2005, 211-238. Springer. E.K. Burke, G. Kendall (Eds.).
9. Hansen P., Mladenović N., Brimberg J., Moreno Pérez J.A. Variable neighbourhood search. Handbook of Metaheuristics 2010, 61-86. Springer. 2nd ed. M. Gendreau, J.-Y. Potvin (Eds.).
10. Knausz, M., Parallel variable neighbourhood search for the car sequencing problem, Technical report, Fakultät für Informatik der Technischen Universität Wien, 2008.
11. Mladenović N., Hansen P. Variable neighborhood search. Comput. & OR 1997, 24:1097-1100.
12. Pirkwieser, S., and G. Raidl, Multiple variable neighborhood search enriched with ilp techniques for the periodic vehicle routing problem with time windows, In: Proceedings of the 6th International Workshop on Hybrid Metaheuristics, Udine, Italy, (2009), 45-59.
13. Polacek M., Benkner S., Doerner K.F., Hartl R.F. A cooperative and adaptive variable neighborhood search for the multi depot vehicle routing problem with time windows. Business Research 2008, 1:1-12.
14. Sevkli M., Aydin M.E. Parallel variable neighbourhood search algorithms for job shop scheduling problems. IMA Journal of Management Mathematics 2007, 18:117-133.
15. Veltman B., Lageweg B.J., Lenstra J.K. Multiprocessor scheduling with communication delays. Parallel Computing 1990, 16:173-182.
16. Yazdani M., Amiri M., Zandieh M. Flexible job-shop scheduling with parallel variable neighborhood search algorithm. Expert Systems with Applications 2010, 37:678-687.