A hybrid heuristic to solve a task allocation problem
From MaRDI portal
Publication:1968601
DOI10.1016/S0305-0548(99)00045-3zbMath0946.90030OpenAlexW1968326804MaRDI QIDQ1968601
Publication date: 21 March 2000
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0305-0548(99)00045-3
Related Items (10)
Reducing multivalued discrete variables in solving separable task assignment problems ⋮ Automatic clustering using genetic algorithms ⋮ Operator allocation planning for reconfigurable production line in one-of-a-kind production ⋮ A proposed solution for the load balancing problem on heterogeneous clusters based on a delayed neural network ⋮ Using \(xQx\) to model and solve the uncapacitated task allocation problem ⋮ Bi-objective task assignment in heterogeneous distributed systems using honeybee mating optimization ⋮ New MIP model for multiprocessor scheduling problem with communication delays ⋮ The noising methods: A generalization of some metaheuristics ⋮ Data-Mining-Driven Neighborhood Search ⋮ A tabu search approach for the minimum sum-of-squares clustering problem
This page was built for publication: A hybrid heuristic to solve a task allocation problem
