On Optimal Allocation in a Distributed Processing Environment

DOI10.1287/MNSC.28.8.839zbMath0487.90057OpenAlexW2070634651MaRDI QIDQ3948871

Amitava Dutta, Gary J. Koehler, Andrew B. Whinston

Publication date: 1982

Published in: Management Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/mnsc.28.8.839

zbMATH Keywords

quadratic assignment problemheuristic algorithmoptimal solutioncomputational experiencecapacity constraintsdistributed processeswarehouse locationoptimal task allocationprobabilistic branch and bound techniquequadratic partitioning modeluncapacitated problem

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Deterministic scheduling theory in operations research (90B35)

Related Items (8)

Efficient algorithms for the capacitated concentrator location problem ⋮ Solution methods for the balancing of jet turbines ⋮ Decentralized task coordination ⋮ Applications of Quadratic Programming ⋮ Using \(xQx\) to model and solve the uncapacitated task allocation problem ⋮ A parallel heuristic for quadratic assignment problems ⋮ Optimizing simulated annealing schedules with genetic programming ⋮ A hybrid genetic/optimization algorithm for a task allocation problem

This page was built for publication: On Optimal Allocation in a Distributed Processing Environment