Modelling flow and jobbing shops as a queueing network for workload control

International Journal of Production Economics

Volumn 78, Issue 3, 2002, Pages 271-285

  Haskose, A ^a   Kingsman, B G ^a   Worthington, D ^a  

^a LANCASTER UNIVERSITY   (United Kingdom)

Author keywords

Job shops; Make to order production; Manufacturing; Markov processes; Queueing theory

Indexed keywords

FORECASTING; JOB ANALYSIS; MARKOV PROCESSES; MATHEMATICAL MODELS; PRODUCTION CONTROL; QUEUEING THEORY;

MAKE-TO-ORDER PRODUCTION;

QUEUEING NETWORKS;

EID: 0037063278     PISSN: 09255273     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0925-5273(01)00117-7     Document Type: Article

References (39)

1. Lead time management
2. Networks of waiting lines
3. Jobshop-like queueing systems
4. Closed queueing systems with exponential servers
5. A mathematical model of computerized manufacturing systems
6. Modelling kanban-based demand-pull systems: A survey and critique
7. Open, closed and mixed networks of queues with different classes of customers
8. Waiting line model applications in manufacturing
9. A proof of the queueing formula L = λW
10. Performance evaluation of production networks
11. Workload control concepts in job shops a critical assessment
12. The effect of workload control on performance in make-to-order companies
13. Mathematical modelling of input-output workload control for dynamic capacity planning at the front end of production planning systems
14. The influence of shop characteristics on workload control
15. On equivalencies of blocking mechanisms in queueing networks with blocking
16. Manufacturing flow line system: A review of models and analytical results
17. Finite queues in series with exponential or Erlang service times - Numerical approach
18. Approximate analysis of exponential tandem queues with blocking
19. Approximate analysis of open networks of queues with blocking: Tandem configurations
20. Approximate analysis of queues in series with phase-type service time and blocking
21. An approximation analysis of open tandem queueing networks with blocking and general service times
22. An approximation method for tandem queues with blocking
23. Analysis of production lines with general service times and finite buffers: A two-node decomposition approach
24. An approximation method for open restricted queuing networks
25. Approximate analysis of arbitrary configurations of open queuing networks with blocking
26. A computationally efficient approximation algorithm for analyzing open queueing networks with blocking
27. Approximate analysis of arbitrary configuration of queueing networks with blocking
28. Approximate analysis of open acyclic exponential queueing networks with blocking
29. Performance evaluation of open queueing networks with arbitrary configuration and finite buffers
30. The queueing network analyzer
31. Production planning systems and their applicability to make-to-order companies