An assembly cell with and automated quality control station. Exponentially distributed processing times
DOI10.1016/0898-1221(90)90134-6zbMATH Open0697.90029OpenAlexW1510386267MaRDI QIDQ911982FDOQ911982
Publication date: 1990
Published in: Computers & Mathematics with Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0898-1221(90)90134-6
simulationadjacent automated quality control stationapproximation outcomesfirst come first servedfixed delay Bernoulli feedback mechanismG/M/1 queueing systemsingle Markovian serverunloading station
Queues and service in operations research (90B22) Queueing theory (aspects of probability theory) (60K25)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Approximate Analysis of General Queuing Networks by Decomposition
- The Correlation Structure of the Output Process of Some Single Server Queueing Systems
- Approximating a Point Process by a Renewal Process, I: Two Basic Methods
- Some Inequalities in Queuing
- On queueing network models of flexible manufacturing systems
Recommendations
- Estimating the throughput of an exponential CONWIP assembly system 👍 👎
- Assembly systems with non-exponential machines: Throughput and bottlenecks 👍 👎
- Asymptotically reliable serial production lines with a quality control system 👍 👎
- Sequential quality control in batch manufacturing 👍 👎
- Robotic cells with parallel machines: throughput maximization in constant travel-time cells 👍 👎
- Throughput, flow times, and service level in an unreliable assembly system 👍 👎
- A spreadsheet method for calculating work completion time probability distributions of paced or linked assembly lines 👍 👎
This page was built for publication: An assembly cell with and automated quality control station. Exponentially distributed processing times
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q911982)
