A heuristic algorithm for the flowshop scheduling problem
Jatinder N. D. Gupta (1976)
RAIRO - Operations Research - Recherche Opérationnelle
Similarity:
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Displaying similar documents to “Worst case analysis of two heuristics for the set partitioning problem”
A heuristic algorithm for the flowshop scheduling problem
A new algorithm for the three counterfeit coins problem.
Bošnjak, Ivica (1998)
Novi Sad Journal of Mathematics
Similarity:
Effects of ordering and updating techniques on the performance of the Karmarkar algorithm
Abdellah Salhi, George R. Lindfield (1991)
RAIRO - Operations Research - Recherche Opérationnelle
Similarity:
Algorithm 49. An algorithm for solving the machine sequencing problem
A. Adrabiński, J. Grabowski (1977)
Applicationes Mathematicae
Similarity:
Polynomial time algorithms for special open shop problems with precedence constraints and unit processing times
Heidemarie Bräsel, Dagmar Kluge, Frank Werner (1996)
RAIRO - Operations Research - Recherche Opérationnelle
Similarity:
Algorithm 45. A heuristic algorithm for the traveling-salesman problem
A. Adrabiński (1976)
Applicationes Mathematicae
Similarity:
Algorithm 12. Minimum of a function of one variable
Z. Cylkowski (1971)
Applicationes Mathematicae
Similarity:
Algorithm 30. The calculation of the minimum of a certain function of one variable
E. Neuman (1974)
Applicationes Mathematicae
Similarity:
Algorithm 24. One-dimensional knapsack function
J. Kucharczyk (1973)
Applicationes Mathematicae
Similarity:
Algorithm 8. A program to shorten a sequence of sets of integer numbers
Krystyna Jerzykiewicz (1970)
Applicationes Mathematicae
Similarity:
Algorithm 16. Implicit enumeration algorithm for solving zero-one integer programs
J. Kucharczyk (1972)
Applicationes Mathematicae
Similarity: