On Optimal Allocation in a Distributed Processing Environment

DOI10.1287/MNSC.28.8.839zbMATH Open0487.90057OpenAlexW2070634651MaRDI QIDQ3948871FDOQ3948871

Authors 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 problemcapacity constraintsheuristic algorithmoptimal solutiondistributed processescomputational experiencewarehouse 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)

Cited in

(8)

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

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

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