Pages that link to "Item:Q4497310"

The following pages link to Solving large unconstrained multilevel lot-sizing problems using a hybrid genetic algorithm (Q4497310):

Displaying 16 items.

• Unequal individual genetic algorithm with intelligent diversification for the lot-scheduling problem in integrated mills using multiple-paper machines (Q337527) (← links)
• Incorporating a database approach into the large-scale multi-level lot sizing problem (Q623205) (← links)
• Non-permutation flow shop scheduling with order acceptance and weighted tardiness (Q670790) (← links)
• Single-point stochastic search algorithms for the multi-level lot-sizing problem (Q707016) (← links)
• Meta-heuristics for dynamic lot sizing: a review and comparison of solution approaches (Q857326) (← links)
• A MAX-MIN ant system for unconstrained multi-level lot-sizing problems (Q875398) (← links)
• Solving uncapacitated multilevel lot-sizing problems using a particle swarm optimization with flexible inertial weight (Q971702) (← links)
• Decentralized multi-level uncapacitated lot-sizing by automated negotiation (Q989827) (← links)
• Heuristic genetic algorithms for general capacitated lot-sizing problems (Q1609180) (← links)
• Neighborhood search techniques for solving uncapacitated multilevel lot-sizing problems (Q1762018) (← links)
• Randomized multi-level lot-sizing heuristics for general product structures. (Q1810504) (← links)
• A variable neighborhood search with an effective local search for uncapacitated multilevel lot-sizing problems (Q2256206) (← links)
• A reduced variable neighborhood search algorithm for uncapacitated multilevel lot-sizing problems (Q2275813) (← links)
• Applying particle swarm optimisation to dynamic lot sizing with batch ordering (Q3055436) (← links)
• Combinatorial optimization and green logistics (Q5900891) (← links)
• Combinatorial optimization and green logistics (Q5925286) (← links)