Pages that link to "Item:Q1968601"
From MaRDI portal
The following pages link to A hybrid heuristic to solve a task allocation problem (Q1968601):
Displaying 11 items.
- Reducing multivalued discrete variables in solving separable task assignment problems (Q290332) (← links)
- Automatic clustering using genetic algorithms (Q648318) (← links)
- A tabu search approach for the minimum sum-of-squares clustering problem (Q1031685) (← links)
- A binary-rounding heuristic for multi-period variable-task-duration assignment problems (Q1919790) (← links)
- Bi-objective task assignment in heterogeneous distributed systems using honeybee mating optimization (Q2017928) (← links)
- Using \(xQx\) to model and solve the uncapacitated task allocation problem (Q2488221) (← links)
- Data-mining-driven neighborhood search (Q2815441) (← links)
- Operator allocation planning for reconfigurable production line in one-of-a-kind production (Q2997882) (← links)
- A proposed solution for the load balancing problem on heterogeneous clusters based on a delayed neural network (Q3563722) (← links)
- New MIP model for multiprocessor scheduling problem with communication delays (Q5915741) (← links)
- The noising methods: A generalization of some metaheuristics (Q5954829) (← links)
