The design of service systems with queueing time cost, workload capacities and backup service

DOI10.1016/S0377-2217(97)82111-XzbMath0955.90016OpenAlexW2076853966MaRDI QIDQ1291646

Ali Amiri

Publication date: 22 February 2001

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0377-2217(97)82111-x

zbMATH Keywords

heuristicsnonlinear integer programmingreliabilityLagrangean relaxationdesign of service system

Mathematics Subject Classification ID

Integer programming (90C10) Approximation methods and heuristics in mathematical programming (90C59) Queueing theory (aspects of probability theory) (60K25) Reliability, availability, maintenance, inspection in operations research (90B25)

Related Items (9)

Service system design for managing interruption risks: a backup-service risk-mitigation strategy ⋮ Reverse logistics network design with stochastic lead times ⋮ 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 ⋮ Robust design of service systems with immobile servers under demand uncertainty ⋮ Designing service system networks with interruption risks ⋮ A multiple server location-allocation model for service system design ⋮ An analysis of \(p\)-median location problem: effects of backup service level and demand assignment policy ⋮ Optimal pricing for service facilities with self-optimizing customers

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
• 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: The design of service systems with queueing time cost, workload capacities and backup service