Dynamic scheduling in manufacturing systems using Brownian approximations
From MaRDI portal
Recommendations
- Optimal Control of a Two-Station Brownian Network
- Dynamic scheduling for queueing networks derived from discrete-review policies
- Brownian Networks with Discretionary Routing
- Dynamic control of Brownian networks: State space collapse and equivalent workload formulations
- Dynamic Scheduling of a Four-Station Queueing Network
Cites work
- A note on the two machine job shop with exponential processing times
- A Polynomial Approximation Scheme for Scheduling on Uniform Processors: Using the Dual Approximation Approach
- A review of the static, stochastic job sequencing literature
- Average Optimal Singular Control and a Related Stopping Problem
- Dynamic Programming State-Space Relaxation for Single-Machine Scheduling
- Finding an Optimal Sequence by Dynamic Programming: An Extension to Precedence-Related Tasks
- scientific article; zbMATH DE number 4078444 (Why is no real title available?)
- Minimizing the Expected Makespan in Stochastic Flow Shops
- Multidimensional reflected Brownian motions having exponential stationary distributions
- Numerical Methods in Markov Chain Modeling
- Open Queueing Networks in Heavy Traffic
- Optimal Control of a Two-Station Brownian Network
- Optimal control of admission to a quenching system
- Optimal control of service rates in networks of queues
- Optimal control of two interacting service stations
- Optimal dynamic scheduling in Jackson networks
- Optimal Solution of Scheduling Problems Using Lagrange Multipliers: Part I
- Random Yield, Rework and Scrap in a Multistage Batch Manufacturing Environment
- Refining diffusion approximations for queues
- Reflected Brownian motion on an orthant
- Scheduling Networks of Queues: Heavy Traffic Analysis of a Multistation Closed Network
- Scheduling networks of queues: Heavy traffic analysis of a simple open network
- 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
- Some Useful Functions for Functional Limit Theorems
- State of the Art—Networks of Queues: A Survey of Weak Convergence Results
- Stochastic Scheduling with Release Dates and Due Dates
- Technical Note—An Improved Lower Bound for Minimizing Weighted Completion Times with Deadlines
- The Lagrangian Relaxation Method for Solving Integer Programming Problems
- The “Largest Variance First” Policy in Some Stochastic Scheduling Problems
- Time-Sharing Service Systems. I
This page was built for publication: Dynamic scheduling in manufacturing systems using Brownian approximations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5955769)