Pages that link to "Item:Q4302718"

The following pages link to Genetic Algorithms for Combinatorial Optimization: The Assemble Line Balancing Problem (Q4302718):

Displaying 17 items.

• A genetic algorithm for the proportionate multiprocessor open shop (Q1010271) (← links)
• A heuristic-based genetic algorithm for workload smoothing in assembly lines (Q1265844) (← links)
• A line up evolutionary algorithm for solving nonlinear constrained optimization problems (Q1764763) (← links)
• Solving large-scale maximum expected covering location problems by genetic algorithms: a comparative study (Q1847206) (← links)
• A comparison of local search methods for flow shop scheduling (Q1919857) (← links)
• Metaheuristics: A bibliography (Q1919858) (← links)
• Simulated annealing and genetic algorithms for scheduling products with multi-level product structure (Q2563875) (← links)
• State-of-the-art exact and heuristic solution procedures for simple assembly line balancing (Q2569059) (← links)
• Balancing assembly lines with tabu search (Q2569069) (← links)
• Core-periphery structure in networks: a statistical exposition (Q2693378) (← links)
• (Q3090670) (← links)
• (Q3587622) (← links)
• Metaheuristics based on Bin Packing for the line balancing problem (Q3598684) (← links)
• Evaluation of performance measures for representing operational objectives of a mixed model assembly line balancing problem (Q3605444) (← links)
• (Q3645453) (← links)
• Balanced-evolution genetic algorithm for combinatorial optimization problems: the general outline and implementation of balanced-evolution strategy based on linear diversity index (Q6084237) (← links)
• A divide-and-conquer algorithm for core-periphery identification in large networks (Q6543929) (← links)