Solution procedures for the service system design problem

DOI10.1016/S0305-0548(96)00022-6zbMath0881.90087OpenAlexW1981184668MaRDI QIDQ1361393

Ali Amiri

Publication date: 23 July 1997

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0305-0548(96)00022-6

zbMATH Keywords

service system designLagrangean relaxationheuristic solution procedures

Mathematics Subject Classification ID

Integer programming (90C10) Queues and service in operations research (90B22) Discrete location and assignment (90B80)

Related Items (13)

Efficient solution of a class of location-allocation problems with stochastic demand and congestion ⋮ Service system design with immobile servers, stochastic demand and concave-cost capacity selection ⋮ Facility location under service level constraints for heterogeneous customers ⋮ Robust design of service systems with immobile servers under demand uncertainty ⋮ Designing service system networks with interruption risks ⋮ Using Lagrangian relaxation to locate hydrogen production facilities under uncertain demand: a case study from Norway ⋮ Linear formulations and valid inequalities for a classic location problem with congestion: a robust optimization application ⋮ Optimal bandwidth allocation for bandwidth adaptation in wireless multimedia networks. ⋮ Submodularity in Conic Quadratic Mixed 0–1 Optimization ⋮ A multiple server location-allocation model for service system design ⋮ Data traffic scheduling algorithm for multiuser OFDM system with adaptive modulation considering fairness among users ⋮ A fast exact method for the capacitated facility location problem with differentiable convex production costs ⋮ Exact solution of a class of nonlinear knapsack problems

Cites Work

• Unnamed Item
• Unnamed Item
• An approximate procedure for determining the number, capacities and locations of solid waste transfer-stations in an urban region
• Locating concentrators in centralized computer networks
• A survey of various tactics for generating Lagrangian multipliers in the context of Lagrangian duality
• An assignment problem with queueing time cost
• Topological design of centralized computer networks—formulations and algorithms
• Continuous Models for Capacity Design of Large Packet-Switched Telecommunication Networks
• Modeling and Heuristic Worst-Case Performance Analysis of the Two-Level Network Design Problem
• New formulation and relaxation to solve a concave-cost network flow problem

This page was built for publication: Solution procedures for the service system design problem