A hybrid heuristic to solve a task allocation problem

DOI10.1016/S0305-0548(99)00045-3MaRDI QIDQ1968601zbMATHOpenAlexFDO

Authors Wun-Hua Chen, Chin-Shien Lin

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

zbMATH Keywords

tabu searchtask allocationnoising method

Mathematics Subject Classification ID

Search theory (90B40)

Recommendations

• A hybrid genetic/optimization algorithm for a task allocation problem
• A variable neighbourhood search algorithm for the constrained task allocation problem
• Hybrid meta-heuristics algorithms for task assignment in heterogeneous computing systems
• scientific article; zbMATH DE number 1737491
• A hybrid heuristic for the generalized assignment problem

Cited in

(12)

• scientific article; zbMATH DE number 1737491 (Why is no real title available?)
• The noising methods: A generalization of some metaheuristics
• Using \(xQx\) to model and solve the uncapacitated task allocation problem
• Data-mining-driven neighborhood search
• A binary-rounding heuristic for multi-period variable-task-duration assignment problems
• A tabu search approach for the minimum sum-of-squares clustering problem
• A proposed solution for the load balancing problem on heterogeneous clusters based on a delayed neural network
• Operator allocation planning for reconfigurable production line in one-of-a-kind production
• Bi-objective task assignment in heterogeneous distributed systems using honeybee mating optimization
• New MIP model for multiprocessor scheduling problem with communication delays
• Automatic clustering using genetic algorithms
• Reducing multivalued discrete variables in solving separable task assignment problems

This page was built for publication: A hybrid heuristic to solve a task allocation problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1968601)