Due date assignment for multistage assembly systems
From MaRDI portal
Publication:1024730
DOI10.1007/S11590-008-0101-XzbMath1179.90073OpenAlexW1978480603MaRDI QIDQ1024730
Publication date: 17 June 2009
Published in: Optimization Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11590-008-0101-x
Stochastic network models in operations research (90B15) Queues and service in operations research (90B22) Markov and semi-Markov decision processes (90C40)
Related Items (1)
Cites Work
- Unnamed Item
- Modelling complex assemblies as a queueing network for lead time control
- Assembly-like queues with finite capacity: Bounds, asymptotics and approximations
- Survey of scheduling research involving due date determination decisions
- Queueing theory in manufacturing systems analysis and design: A classification of models for production and transfer lines
- A Markovian single server with upstream job and downstream demand arrival stream
- Distribution function of the shortest path in networks of queues
- Sequencing and due-date determination in the stochastic single machine problem with earliness and tardiness costs
- Optimal control of service rates and arrivals in Jackson networks
- Performance analysis and buffer allocations in some open assembly systems.
- Approximations for the time spent in a dynamic job shop with applications to due-date assignment
- Due Date Assignment for Production Systems
- Steady state waiting time in a multicenter job shop
- Markov and Markov-Regenerative <scp>pert</scp> Networks
- Assembly-like queues
- Critical Path Analyses Via Chance Constrained and Stochastic Programming
- Distribution of the Time Through a Directed, Acyclic Network
This page was built for publication: Due date assignment for multistage assembly systems
