Multiple-facility loading under capacity-based economies of scope

DOI<229::AID-NAV1>3.0.CO;2-A 10.1002/(SICI)1520-6750(199704)44:3<229::AID-NAV1>3.0.CO;2-AzbMath0890.90123OpenAlexW2092934470MaRDI QIDQ4367298

Robert Schantz, Joseph B. Mazzola

Publication date: 25 November 1997

Full work available at URL: https://doi.org/10.1002/(sici)1520-6750(199704)44:3<229::aid-nav1>3.0.co;2-a

zbMATH Keywords

branch-and-boundtabu-searchcapacity-based economiesmultiple-facility loading

Mathematics Subject Classification ID

Discrete location and assignment (90B80)

Related Items

A Survey of the Generalized Assignment Problem and Its Applications ⋮ A manufacturing network design model based on processor and worker capabilities ⋮ A dynamic tabu search for large-scale generalized assignment problems ⋮ Lagrangian-relaxation-based solution procedures for a multiproduct capacitated facility location problem with choice of facility type