Capacity planning in manufacturing networks with discrete options

DOI10.1007/BF02096601zbMath0704.90040MaRDI QIDQ917425

Gabriel R. Bitran, Devanath Tirupati

Publication date: 1989

Published in: Annals of Operations Research (Search for Journal in Brave)

zbMATH Keywords

heuristicnonlinear integer programcapacity planningmultiproduct manufacturing systemsopen networks of queuestargeting problem

Mathematics Subject Classification ID

Stochastic network models in operations research (90B15) Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22) Production models (90B30) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items (17)

Targeting problems in manufacturing queueing networks -- an iterative scheme and convergence ⋮ Throughput analysis in manufacturing networks ⋮ Solving coupled task assignment and capacity planning problems for a job shop by using a concurrent genetic algorithm ⋮ Unnamed Item ⋮ Capacity planning in networks of queues with manufacturing applications ⋮ Optimizing production capacity and safety stocks in general acyclic supply chains ⋮ Tactical Portfolio Planning in the Natural Gas Supply Chain ⋮ A review of open queueing network models of manufacturing systems ⋮ Design of manufacturing systems using queueing models ⋮ Planning capacity and safety stocks in a serial production-distribution system with multiple products ⋮ Optimal capacity allocation in a production-inventory system with base stock ⋮ Heuristics for capacity planning problems with congestion ⋮ Capacity planning in manufacturing and computer networks ⋮ Nonlinear programming for multiperiod capacity planning in a manufacturing system ⋮ Point and interval estimation of decomposition error in discrete-time open tandem queues ⋮ Optimization analysis for design and planning of multi-project programs ⋮ The nonlinear knapsack problem - algorithms and applications

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• An efficient method to determine the optimal configuration of a flexible manufacturing system
• On queueing network models of flexible manufacturing systems
• Approximating a Point Process by a Renewal Process, II: Superposition Arrival Processes to Queues
• Approximations for departure processes and queues in series
• A Concept of Monotonicity and Its Characterization for Closed Queueing Networks
• The Optimality of Unbalancing Both Workloads and Machine Group Sizes in Closed Queueing Networks of Multiserver Queues
• The effect of increasing service rates in a closed queueing network
• The Optimal Input Rates To A System Of Manufacturing Cells
• Optimal static load balancing in distributed computer systems
• Multiproduct Queueing Networks with Deterministic Routing: Decomposition Approach and the Notion of Interference
• Optimal Server Allocation in a System of Multi-Server Stations
• Reducing the Congestion in a Class of Job Shops
• Stochastic Monotonicity of the Queue Lengths in Closed Queueing Networks
• Optimal Selection of CPU Speed, Device Capacities, and File Assignments
• Approximating a Point Process by a Renewal Process, I: Two Basic Methods
• Networks of queues with customers of different types
• State-of-the-Art—Networks of Queues—A Survey of Equilibrium Analysis
• Approximate Analysis of General Queuing Networks by Decomposition
• Accuracy of the Diffusion Approximation for Some Queuing Systems
• A Light-Traffic Approximation for Single-Class Departure Processes from Multi-Class Queues

This page was built for publication: Capacity planning in manufacturing networks with discrete options