A heuristic algorithm for the flowshop scheduling problem
Jatinder N. D. Gupta (1976)
RAIRO - Operations Research - Recherche Opérationnelle
Similarity:
Displaying similar documents to “Simulated annealing algorithm for the minimum weighted perfect euclidean matching problem”
A heuristic algorithm for the flowshop scheduling problem
Simulated annealing algorithm : technical improvements
D. Delamarre, B. Virot (1998)
RAIRO - Operations Research - Recherche Opérationnelle
Similarity:
A locally optimal insertion heuristic for a one-machine scheduling problem
Frank Werner (1990)
RAIRO - Operations Research - Recherche Opérationnelle
Similarity:
A heuristic column generation method for the heterogeneous fleet VRP
É. D. Taillard (1999)
RAIRO - Operations Research - Recherche Opérationnelle
Similarity:
Advanced search techniques for the job shop problem : a comparison
R. Tadei, F. Della Croce, G. Menga (1995)
RAIRO - Operations Research - Recherche Opérationnelle
Similarity:
The weighted minimax location problem with set-up costs and extensions
Zvi Drezner (1991)
RAIRO - Operations Research - Recherche Opérationnelle
Similarity:
Variable Neighborhood Search for Solving the Capacitated Single Allocation Hub Location Problem
Maric, Miroslav (2013)
Serdica Journal of Computing
Similarity:
In this paper a Variable Neighborhood Search (VNS) algorithm for solving the Capacitated Single Allocation Hub Location Problem (CSAHLP) is presented. CSAHLP consists of two subproblems; the first is choosing a set of hubs from all nodes in a network, while the other comprises finding the optimal allocation of non-hubs to hubs when a set of hubs is already known. The VNS algorithm was used for the first subproblem, while the CPLEX solver was used for the second. Computational results...
Probabilistic analysis of two euclidean location problems
A. Marchetti-Spaccamela, M. Talamo (1983)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity: