The multi-hour service system design problem
DOI10.1016/S0377-2217(99)00397-5zbMath0996.90036OpenAlexW2058163374MaRDI QIDQ5925868
Publication date: 20 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(99)00397-5
heuristicsLagrangian relaxationnonlinear integer programmingresponse timeservice system designtime varying demand
Integer programming (90C10) Nonlinear programming (90C30) Approximation methods and heuristics in mathematical programming (90C59) Numerical methods based on nonlinear programming (49M37) Reliability, availability, maintenance, inspection in operations research (90B25)
Related Items (4)
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
- Primary and secondary route selection in backbone communication networks
- An assignment problem with queueing time cost
- Lagrangean decomposition: A model yielding stronger lagrangean bounds
- Lagrangean decomposition for integer programming : theory and applications
- 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 multi-hour service system design problem