Capacity planning in manufacturing and computer networks

DOI10.1016/0377-2217(94)00302-5zbMath0924.90074OpenAlexW2011362826MaRDI QIDQ1278227

Kurt M. Bretthauer

Publication date: 22 February 1999

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

Full work available at URL: https://doi.org/10.1016/0377-2217(94)00302-5

zbMATH Keywords

branch and boundnonlinear programmingqueueing networkscapacity planning

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Nonlinear programming (90C30) Queues and service in operations research (90B22) Production models (90B30) Deterministic network models in operations research (90B10)

Related Items

A survey on the continuous nonlinear resource allocation problem, A novel breakthrough system for mixed production goaling and control in semiconductor manufacturing, Nonlinear programming for multiperiod capacity planning in a manufacturing system

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Capacity planning in manufacturing networks with discrete options
• An algorithm for a singly constrained class of quadratic programs subject upper and lower bounds
• A note on adapting methods for continuous global optimization to the discrete case
• Tradeoff Curves, Targeting and Balancing in Manufacturing Queueing Networks
• A polynomially bounded algorithm for a singly constrained quadratic program
• Backbone Network Design Tools with Economic Tradeoffs
• Safety Stock versus Safety Time in MRP Controlled Production Systems
• Networks of Waiting Lines
• The flow deviation method: An approach to store‐and‐forward communication network design