Dynamic scheduling in manufacturing systems using Brownian approximations

DOI10.1007/BF02743936zbMath1009.90051OpenAlexW2048311888MaRDI QIDQ5955769

No author found.

Publication date: 18 February 2002

Published in: Sādhanā (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02743936

zbMATH Keywords

functional central limit theoremmanufacturing systemsapproximate multiclass queueing networksbalanced heavy loadingBrownian networksdynamic scheduling

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Queueing theory (aspects of probability theory) (60K25) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Applications of queueing theory (congestion, allocation, storage, traffic, etc.) (60K30)

Cites Work

• Unnamed Item
• Refining diffusion approximations for queues
• A review of the static, stochastic job sequencing literature
• Reflected Brownian motion on an orthant
• Multidimensional reflected Brownian motions having exponential stationary distributions
• Scheduling networks of queues: Heavy traffic analysis of a simple open network
• Technical Note—An Improved Lower Bound for Minimizing Weighted Completion Times with Deadlines
• Optimal Control of a Two-Station Brownian Network
• Optimal control of two interacting service stations
• A note on the two machine job shop with exponential processing times
• Open Queueing Networks in Heavy Traffic
• Stochastic Scheduling with Release Dates and Due Dates
• Average Optimal Singular Control and a Related Stopping Problem
• Optimal control of admission to a quenching system
• The “Largest Variance First” Policy in Some Stochastic Scheduling Problems
• A Polynomial Approximation Scheme for Scheduling on Uniform Processors: Using the Dual Approximation Approach
• Dynamic Programming State-Space Relaxation for Single-Machine Scheduling
• Optimal dynamic scheduling in Jackson networks
• Some Useful Functions for Functional Limit Theorems
• The Lagrangian Relaxation Method for Solving Integer Programming Problems
• Minimizing the Expected Makespan in Stochastic Flow Shops
• Random Yield, Rework and Scrap in a Multistage Batch Manufacturing Environment
• Numerical Methods in Markov Chain Modeling
• Optimal Solution of Scheduling Problems Using Lagrange Multipliers: Part I
• Finding an Optimal Sequence by Dynamic Programming: An Extension to Precedence-Related Tasks
• Time-Sharing Service Systems. I
• State of the Art—Networks of Queues: A Survey of Weak Convergence Results
• Scheduling Networks of Queues: Heavy Traffic Analysis of a Multistation Closed Network
• Optimal control of service rates in networks of queues
• Scheduling Networks of Queues: Heavy Traffic Analysis of a Two-Station Closed Network
• Scheduling Networks of Queues: Heavy Traffic Analysis of a Two-Station Network with Controllable Inputs
• Scheduling spares with exponential lifetimes in a two-component parallel system

This page was built for publication: Dynamic scheduling in manufacturing systems using Brownian approximations